Finite-Dimensional Bounds on {\BBZ}_m and Binary LDPC Codes With Belief Propagation Decoders

DOI10.1109/TIT.2006.887085MaRDI QIDQ3548167zbMATH OpenOpenAlexFDO

Authors Chih-Chun Wang, Sanjeev R. Kulkarni, H. Vincent Poor

Publication date 21 December 2008

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

Full work available at URL https://doi.org/10.1109/tit.2006.887085

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Decoding (94B35)

Recommendations

• Bounds on the performance of belief propagation decoding
• Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications
• Upper bounds on the rate of LDPC codes
• Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
• On the error-correcting capability of LDPC codes

Cited in

(1)

• Bounds on the performance of belief propagation decoding

This page was built for publication: Finite-Dimensional Bounds on ${\BBZ}_m$ and Binary LDPC Codes With Belief Propagation Decoders

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