We study the performance of Low Density Parity Check (LDPC) error-correcting codes using the methods of statistical physics. LDPC codes are based on the generation of codewords using Boolean sums of the original message bits by employing two randomlyconstructed sparse matrices. These codes can be mapped onto Ising spin models and studied using common methods of statistical physics. We examine various regular constructions and obtain insight into their theoretical and practical limitations. We also briefly report on results obtained for irregular code constructions, for codes with non-binary alphabet, and on how a finite system size effects the error probability.
CITATION STYLE
Saad, D., Kabashima, Y., Murayama, T., & Vicente, R. (2001). Statistical physics of low density parity check error correcting codes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2260, pp. 307–316). Springer Verlag. https://doi.org/10.1007/3-540-45325-3_27
Mendeley helps you to discover research relevant for your work.