Error-correcting code on a cactus: a solvable model
Renato Vicente, David Saad, Yoshiyuki Kabashima
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.
Create a lesson
Related papers
Cell-type-specific modularity in E/I networks shapes dynamical regimes and computational capabilities
Emmanouil Giannakakis, Victor Buendía, Oleg Vinogradov et al.
Finite-width shift of the edge of chaos in deep neural networks
Arn Caesar
Neural Networks with Exciton-Polariton Waveguides
Huawen Xu, Ruiqi Bao, Lingyu Tian et al.
Optical Ceiling on Polaron Mobility in Disordered Molecular Semiconductors: Lessons from Eumelanin
Alvan Hunt
Glauber dynamics of the Sherrington--Kirkpatrick spin-glass model: a dynamical cavity method
Grzegorz Szamel
Generative diffusion in long-range correlated landscapes: Speciation cascade and the foam structure of the score
Jerome Garnier-Brun, Giulio Biroli, Marc Mézard et al.