Capacity-Achieving Codes With Bounded Graphical Complexity and Maximum Likelihood Decoding

DOI10.1109/TIT.2009.2039084MaRDI QIDQ5281562zbMATH OpenFDO

Authors Chun-Hao Hsu, Achilleas Anastasopoulos

Publication date 27 July 2017

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

Full work available at URL https://doi.org/10.1109/TIT.2009.2039084

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Decoding (94B35)

Cited in

(2)

• The Maximum-Likelihood Decoding Threshold for Cycle Codes of Graphs
• Bounds on the number of states in encoder graphs for input-constrained channels

This page was built for publication: Capacity-Achieving Codes With Bounded Graphical Complexity and Maximum Likelihood Decoding

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