Trellis complexity of short linear codes

Summary, in English

An extended table of Shuurman's bounds on the state complexity of short binary linear codes is presented. Some new lower and upper bounds are obtained. Most of the newly found codes are based on the so-called double zero-tail termination (DZT) construction

• Författare: Irina Bocharova; Rolf Johannesson; Boris Kudryashov
• Avdelning/ar: Institutionen för elektro- och informationsteknik
• Publiceringsår: 2007
• Språk: Engelska
• Sidor: 361-368
• Publikation/Tidskrift/Serie: IEEE Transactions on Information Theory
• Volym: 53
• Issue: 1
• Länkar: http://dx.doi.org/10.1109/TIT.2006.887522
• Dokumenttyp: Artikel i tidskrift
• Förlag: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Ämne: Electrical Engineering, Electronic Engineering, Information Engineering
• Nyckelord: short binary linear codes; double zero-tail termination; linear codes; binary codes; trellis codes; DZT; Shuurman's bound; trellis complexity
• Status: Published
• ISBN/ISSN/Övrigt: ISSN: 0018-9448