# Lowering the error floor of Gallager codes: a statistical-mechanical view

@article{Pretti2014LoweringTE, title={Lowering the error floor of Gallager codes: a statistical-mechanical view}, author={Marco Antonio M. Pretti}, journal={ArXiv}, year={2014}, volume={abs/1407.0521} }

The error correction for Gallager's low-density parity-check codes is a problem famously equivalent to that of computing marginal Boltzmann probabilities for an Ising-like model with multispin interactions in a non-uniform magnetic field. Since the graph of interactions is locally a tree, the solution is very well approximated by a generalized mean-field (Bethe–Peierls) approximation. Belief propagation (BP) and similar iterative algorithms are an efficient method to perform the calculation…

## References

SHOWING 1-10 OF 55 REFERENCES

Statistical mechanics of low-density parity-check codes

- Mathematics
- 2004

We review recent theoretical progress on the statistical mechanics of error correcting codes, focusing on low-density parity-check (LDPC) codes in general, and on Gallager and MacKay-Neal codes in…

Reduced-complexity decoding of LDPC codes

- Mathematics, Computer ScienceIEEE Transactions on Communications
- 2005

The unified treatment of decoding techniques for LDPC codes presented here provides flexibility in selecting the appropriate scheme from performance, latency, computational-complexity, and memory-requirement perspectives.

Divide and Concur and Difference-Map BP Decoders for LDPC Codes

- Computer Science, MathematicsIEEE Transactions on Information Theory
- 2011

It is shown that this “difference-map belief propagation” (DMBP) decoder has dramatically improved error-floor performance compared to standard BP decoders, while maintaining a similar computational complexity.

Lowering the Error Floor of LDPC Codes Using Cyclic Liftings

- Mathematics, Computer ScienceIEEE Trans. Inf. Theory
- 2011

The error floor improves consistently by increasing the lifting degree, and the results show significant improvements in the error floor compared to the base code, a random code of the same degree distribution and block length, and a random lifting of thesame degree.

Diagnosis of weaknesses in modern error correction codes: a physics approach

- Computer Science, PhysicsPhysical review letters
- 2005

It is shown how the instanton method of physics allows one to solve the problem of BER analysis in the weak noise range by recasting it as a computationally tractable minimization problem.

Low-floor decoders for LDPC codes

- Mathematics, Computer ScienceIEEE Transactions on Communications
- 2009

It is shown in this paper that once the authors identify the trapping sets of an LDPC code of interest, a sum-product algorithm (SPA) decoder can be custom-designed to yield floors that are orders of magnitude lower than floors of the the conventional SPA decoder.

The renaissance of Gallager's low-density parity-check codes

- Computer ScienceIEEE Commun. Mag.
- 2003

The basic structure of LDPC codes and the iterative algorithms that are used to decode them are reviewed and the state of the art is considered.

Message-Passing Algorithms for Inference and Optimization

- Mathematics
- 2011

Message-passing algorithms can solve a wide variety of optimization, inference, and constraint satisfaction problems. The algorithms operate on factor graphs that visually represent and specify the…

Factor graphs and the sum-product algorithm

- Computer ScienceIEEE Trans. Inf. Theory
- 2001

A generic message-passing algorithm, the sum-product algorithm, that operates in a factor graph, that computes-either exactly or approximately-various marginal functions derived from the global function.

Advanced mean field methods: theory and practice

- Mathematics
- 2001

A major problem in modern probabilistic modeling is the huge computational complexity involved in typical calculations with multivariate probability distributions when the number of random variables…