Searching for tailbiting codes with large minimum distances

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

• Författare: Irina Bocharova; Boris Kudryashov; Rolf Johannesson; Per Ståhl
• Avdelning/ar: Institutionen för elektro- och informationsteknik
• Publiceringsår: 2000
• Språk: Engelska
• Sidor: 341-341
• Publikation/Tidskrift/Serie: [Host publication title missing]
• Fulltext: - 113 kB; Download statistics
• Länkar: http://dx.doi.org/10.1109/ISIT.2000.866639
• Dokumenttyp: Konferensbidrag
• Ämne: 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/Övrigt: ISBN: 0-7803-5857-0