arXiv · cond-mat/0205051
The Dynamic Phase Transition for Decoding Algorithms
Abstract
The state-of-the-art error correcting codes are based on large random constructions (random graphs, random permutations, ...) and are decoded by linear-time iterative algorithms. Because of these features, they are remarkable examples of diluted mean-field spin glasses, both from the static and from the dynamic points of view. We analyze the behavior of decoding algorithms using the mapping onto statistical-physics models. This allows to understand the intrinsic (i.e. algorithm independent) features of this behavior.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Silvio Franz, Michele Leone, Andrea Montanari, Federico Ricci-Tersenghi. 2002-05-02. The Dynamic Phase Transition for Decoding Algorithms. https://doi.org/10.1103/physreve.66.046120
Cite the original work for its findings. Save a collection to share your selection of sources.