Iterative decoding of LDPC codes: some bounds and properties

DOI10.1016/S0378-4371(01)00438-1zbMath0980.68046MaRDI QIDQ5951417

Gadi Miller, David Burshtein

Publication date: 6 January 2002

Published in: Physica A (Search for Journal in Brave)

zbMATH Keywords

binary-input symmetric-output channellow-density parity-check codesmessage passing algorithms

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites Work

• Unnamed Item
• Unnamed Item
• Expander codes
• Improved low-density parity-check codes using irregular graphs
• The capacity of low-density parity-check codes under message-passing decoding
• Design of capacity-approaching irregular low-density parity-check codes
• Expander graph arguments for message-passing algorithms
• Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
• Bounds on the performance of belief propagation decoding
• On ensembles of low-density parity-check codes: asymptotic distance distributions
• Good error-correcting codes based on very sparse matrices

This page was built for publication: Iterative decoding of LDPC codes: some bounds and properties