Trellis decoding complexity of linear block codes

DOI10.1109/18.556665MaRDI QIDQ3129453zbMATH OpenOpenAlexFDO

Authors

Publication date 27 April 1997

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

Full work available at URL https://authors.library.caltech.edu/5566/

zbMATH Keywords

block codesdimension/length profilesminimal trellisestrellis complexitytrellis decoding

Mathematics Subject Classification ID

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

Recommendations

• Bounds on complexity of trellis decoding of linear block codes
• Lower bounds on trellis complexity of block codes
• On complexity of trellis structure of linear block codes

Cited in

(26)

• On the comparative complexity of algorithms for constructing the syndrome trellis of a linear block code
• Bounds on complexity of trellis decoding of linear block codes
• On trellis structures for Reed-Muller codes
• MAP algorithms for decoding linear block codes based on sectionalized trellis diagrams
• Trellis complexity versus the coding gain of lattices. II
• Complexity and sliding-block decodability
• scientific article; zbMATH DE number 3859037 (Why is no real title available?)
• Codes on graphs: constraint complexity of cycle-free realizations of linear codes
• Trellis Complexity of Short Linear Codes
• Bounds on the trellis size of linear block codes
• scientific article; zbMATH DE number 4123671 (Why is no real title available?)
• On complexity of trellis structure of linear block codes
• Trellis complexity of linear block codes via atomic codewords
• scientific article; zbMATH DE number 1181550 (Why is no real title available?)
• Te "art of trellis decoding" is computationally hard-for large fields
• scientific article; zbMATH DE number 1500506 (Why is no real title available?)
• Designing lexicographic codes with a given trellis complexity
• The weighted coordinates bound and trellis complexity of block codes and periodic packings
• The Preparata and Goethals codes: trellis complexity and twisted squaring constructions
• On the trellis complexity of certain binary linear block codes
• Dimension/length profiles and trellis complexity of linear block codes
• Trellis-oriented decomposition and trellis complexity of composite-length cyclic codes
• On the trellis structure of block codes
• Lower bounds on trellis complexity of block codes
• On the BCJR trellis for linear block codes
• The “Art of Trellis Decoding” Is NP-Hard

This page was built for publication: Trellis decoding complexity of linear block codes

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