New Sequences of Capacity Achieving LDPC Code Ensembles Over the Binary Erasure Channel

DOI10.1109/TIT.2010.2053874MaRDI QIDQ5281184zbMATH OpenOpenAlexFDO

Authors Hamid Saeedi, Amir H. Banihashemi

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

Mathematics Subject Classification ID

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

Cited in

(4)

• Cospectral bipartite graphs with the same degree sequences but with different number of large cycles
• Threshold Saturation for Nonbinary SC-LDPC Codes on the Binary Erasure Channel
• Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity
• A Finite-Length Algorithm for LDPC Codes Without Repeated Edges on the Binary Erasure Channel

This page was built for publication: New Sequences of Capacity Achieving LDPC Code Ensembles Over the Binary Erasure Channel

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