The Dynamic Phase Transition for Decoding Algorithms

Details The Dynamic Phase Transition for Decoding Algorithms The Dynamic Phase Transition for Decoding Algorithms

2002-05-02

arxiv.org/abs/cond-mat/0205051v1

Phys. Rev. E 66, 046120 (2002)

Physics

Condensed Matter

Disordered Systems and Neural Networks

40 pages, 29 eps figures

Scientific paper

10.1103/PhysRevE.66.046120

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.

Affiliated with

Also associated with

No associations

Rating

The Dynamic Phase Transition for Decoding Algorithms does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Dynamic Phase Transition for Decoding Algorithms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Dynamic Phase Transition for Decoding Algorithms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-232202