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

DOI10.1109/TIT.2003.813558MaRDI QIDQ3546881zbMATH OpenOpenAlexFDO

Authors 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

Recommendations

• Codes on graphs: normal realizations
• scientific article; zbMATH DE number 1714662
• Publication:4502606
• Which codes have cycle-free Tanner graphs?
• Trellis decoding complexity of linear block codes

Cited in

(6)

• On Viterbi-like algorithms and their application to Reed-Muller codes
• The Maximum-Likelihood Decoding Threshold for Cycle Codes of Graphs
• scientific article; zbMATH DE number 2063213 (Why is no real title available?)
• Codes on graphs: normal realizations
• Conditionally Cycle-Free Graphical Models for Coset Codes
• The “Art of Trellis Decoding” Is NP-Hard

This page was built for publication: Codes on graphs: constraint complexity of cycle-free realizations of linear codes

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