arXiv · cond-mat/0604267
Survey propagation for the cascading Sourlas code
Abstract
We investigate how insights from statistical physics, namely survey propagation, can improve decoding of a particular class of sparse error correcting codes. We show that a recently proposed algorithm, time averaged belief propagation, is in fact intimately linked to a specific survey propagation for which Parisi's replica symmetry breaking parameter is set to zero, and that the latter is always superior to belief propagation in the high connectivity limit. We briefly look at further improvements available by going to the second level of replica symmetry breaking.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Jonathan PL Hatchett, Yoshiyuki Kabashima. 2006-04-11. Survey propagation for the cascading Sourlas code. https://doi.org/10.1088/0305-4470%2F39%2F34%2F005
Cite the original work for its findings. Save a collection to share your selection of sources.