Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity

DOI10.1109/TIT.2007.892771zbMATH Open1310.94088MaRDI QIDQ3548869FDOQ3548869

Authors: S. Freundlich, David Burshtein, Simon Litsyn 

Publication date: 21 December 2008

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

Recommendations

• On Universal Properties of Capacity-Approaching LDPC Code Ensembles
• Distance Bounds for an Ensemble of LDPC Convolutional Codes
• LDPC codes from triangle-free line sets
• Asymptotic Enumeration Methods for Analyzing LDPC Codes
• LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes
• LP/SDP hierarchy lower bounds for decoding random LDPC codes
• Asymptotic bounds on the decoding error probability for two ensembles of LDPC codes
• Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity
• On ensembles of low-density parity-check codes: asymptotic distance distributions
• Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles

Mathematics Subject Classification ID

Source coding (94A29) Cyclic codes (94B15)

Cited In (3)

• Efficient encoding of low-density parity-check codes
• Asymptotic Spectra of Trapping Sets in Regular and Irregular LDPC Code Ensembles
• New encoding/decoding scheme for rotation LDPC codes

This page was built for publication: Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity

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