Codes on graphs: constraint complexity of cycle-free realizations of linear codes

DOI10.1109/TIT.2003.813558zbMath1300.94118OpenAlexW2137688127MaRDI QIDQ3546881

G. David jun. Forney

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.2003.813558

Mathematics Subject Classification ID

Applications of graph theory (05C90) Linear codes (general theory) (94B05) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Related Items

The “Art of Trellis Decoding” Is NP-Hard, On Viterbi-like algorithms and their application to Reed-Muller codes