Survey propagation at finite temperature: application to a Sourlas code as a toy model
From MaRDI portal
Publication:3379299
DOI10.1088/0305-4470/39/6/004zbMATH Open1102.82017OpenAlexW2158823479MaRDI QIDQ3379299FDOQ3379299
Abstract: In this paper we investigate a finite temperature generalization of survey propagation, by applying it to the problem of finite temperature decoding of a biased finite connectivity Sourlas code for temperatures lower than the Nishimori temperature. We observe that the result is a shift of the location of the dynamical critical channel noise to larger values than the corresponding dynamical transition for belief propagation, as suggested recently by Migliorini and Saad for LDPC codes. We show how the finite temperature 1-RSB SP gives accurate results in the regime where competing approaches fail to converge or fail to recover the retrieval state.
Recommendations
- Survey propagation for the cascading Sourlas code
- scientific article; zbMATH DE number 2226644
- Survey propagation as local equilibrium equations
- Theory and Applications of Satisfiability Testing
- Code optimization, frozen glassy phase and improved decoding algorithms for low-density parity-check codes
Cited in
(3)
This page was built for publication: Survey propagation at finite temperature: application to a Sourlas code as a toy model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3379299)
