Publikationer
Searching for tailbiting codes with large minimum distances
Avdelning/ar:
Publiceringsår: 2000
Språk: Engelska
Sidor:
Fulltext:
Dokumenttyp: Konferensbidrag
Sammanfattning
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
Disputation
Nyckelord
- Technology and Engineering
Övrigt
2000 International Symposium on Information Theory
2000-06-21/2000-06-25
Sorrento, Italy
Published
Yes
"This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder."
- ISBN: 0-7803-5857-0
