Trellis Complexity of Short Linear Codes

DOI10.1109/TIT.2006.887522MaRDI QIDQ3548252zbMATH OpenOpenAlexFDO

Authors Irina E. Bocharova, Rolf Johannesson, Boris D. Kudryashov

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2006.887522

Mathematics Subject Classification ID

Combined modulation schemes (including trellis codes) in coding theory (94B12)

Recommendations

• Lower bounds on trellis complexity of block codes
• A table of state complexity bounds for binary linear codes
• Lower Bounds on the State Complexity of Linear Tail-Biting Trellises
• Trellis decoding complexity of linear block codes
• On complexity of trellis structure of linear block codes

Cited in

(5)

• Trellis complexity versus the coding gain of lattices. II
• A table of state complexity bounds for binary linear codes
• Low State Complexity Block Codes Via Convolutional Codes
• Lower Bounds on the State Complexity of Linear Tail-Biting Trellises
• Trellis complexity of linear block codes via atomic codewords

This page was built for publication: Trellis Complexity of Short Linear Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548252)