Critical Noise Levels for LDPC decoding
arXiv:cond-mat/0203159 · doi:10.1103/PhysRevE.66.026705
Abstract
We determine the critical noise level for decoding low density parity check error correcting codes based on the magnetization enumerator ($\cM$), rather than on the weight enumerator ($\cW$) employed in the information theory literature. The interpretation of our method is appealingly simple, and the relation between the different decoding schemes such as typical pairs decoding, MAP, and finite temperature decoding (MPM) becomes clear. In addition, our analysis provides an explanation for the difference in performance between MN and Gallager codes. Our results are more optimistic than those derived via the methods of information theory and are in excellent agreement with recent results from another statistical physics approach.
arXiv comment9 pages, 5 figures
References in corpus (6)
- The Nishimori line and Bayesian Statistics
- The glassy phase of Gallager codes
- Typical Performance of Gallager-type Error-Correcting Codes
- The Statistical Physics of Regular Low-Density Parity-Check Error-Correcting Codes
- Error-correcting code on a cactus: a solvable model
- Tighter Decoding Reliability Bound for Gallager's Error-Correcting Code
Cited by in corpus (5)
- Finite-Connectivity Spin-Glass Phase Diagrams and Low Density Parity Check Codes
- Average and reliability error exponents in low-density parity-check codes
- Typical performance of low-density parity-check codes over general symmetric channels
- Code optimization, frozen glassy phase and improved decoding algorithms for low-density parity-check codes
- Magnetization enumerator of real-valued symmetric channels in Gallager error-correcting codes