Error-correcting code on a cactus:A solvable model

Vicente, Renato, Saad, David and Kabashima, Yoshiyuki (2000). Error-correcting code on a cactus:A solvable model. Europhysics Letters, 51 (6), pp. 698-704.

Abstract

An exact solution to a family of parity check error-correcting codes is provided by mapping the problem onto a Husimi cactus. The solution obtained in the thermodynamic limit recovers the replica-symmetric theory results and provides a very good approximation to finite systems of moderate size. The probability propagation decoding algorithm emerges naturally from the analysis. A phase transition between decoding success and failure phases is found to coincide with an information-theoretic upper bound. The method is employed to compare Gallager and MN codes.

Publication DOI: https://doi.org/10.1209/epl/i2000-00395-x
Divisions: Engineering & Applied Sciences > Mathematics
Engineering & Applied Sciences > Systems analytics research institute (SARI)
Additional Information: Copyright of EDP Sciences
Uncontrolled Keywords: error-correcting codes,replica symmetric theory,finite systems,propagation decoding algorithm,Physics and Astronomy(all)
Full Text Link:
Related URLs: http://www.scop ... tnerID=8YFLogxK (Scopus URL)
http://iopscien ... ect=.iopscience (Publisher URL)
Published Date: 2000-09-15
Authors: Vicente, Renato
Saad, David ( 0000-0001-9821-2623)
Kabashima, Yoshiyuki

Download

[img]

Version: Accepted Version


Export / Share Citation


Statistics

Additional statistics for this record