The rate of regular ldpc codes

DOI10.1109/TIT.2003.818403zbMATH Open1301.94166MaRDI QIDQ3547375FDOQ3547375

Authors:

Publication date: 21 December 2008

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

Recommendations

• Upper bounds on the rate of LDPC codes
• Upper bounds on the rate of LDPC codes as a function of minimum distance
• On the Asymptotic Weight and Stopping Set Distribution of Regular LDPC Ensembles
• On ensembles of low-density parity-check codes: asymptotic distance distributions
• Typical performance of regular low-density parity-check codes over general symmetric channels

zbMATH Keywords

regular low-density parity-check codes

Mathematics Subject Classification ID

Bounds on codes (94B65)

Cited In (1)

• Upper bounds on the rate of LDPC codes

This page was built for publication: The rate of regular ldpc codes

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