The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Searching for tailbiting codes with large minimum distances

På svenska

Author

Summary, in English

Tailbiting trellis representations of linear block codes with an arbitrary sectionalization of the time axis are studied. A new lower bound on the maximal state complexity of an arbitrary tailbiting code is derived. The asymptotic behavior of the derived bound is investigated. Some new tailbiting representations for linear block codes of rates R=1/c, c=2,3,4 are presented

Publishing year

2000

Language

English

Pages

341-341

Publication/Series

[Host publication title missing]

Document type

Conference paper

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Conference name

2000 International Symposium on Information Theory

Conference date

2000-06-21 - 2000-06-25

Conference place

Sorrento, Italy

Status

Published

ISBN/ISSN/Other

  • ISBN: 0-7803-5857-0