On Universal Properties of Capacity-Approaching LDPC Code Ensembles

DOI10.1109/TIT.2009.2021305MaRDI QIDQ4975909zbMATH OpenFDO

Authors Igal Sason

Publication date 8 August 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.2021305

Mathematics Subject Classification ID

Decoding (94B35) Other types of codes (94B60)

Cited in

(1)

• Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity

This page was built for publication: On Universal Properties of Capacity-Approaching LDPC Code Ensembles

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