Cascading Parity-Check Error-Correcting Codes

Abstract

A method for improving the performance of sparse-matrix based parity check codes is proposed, based on insight gained from methods of statistical physics. The advantages of the new approach are demonstrated on an existing encoding/decoding paradigm suggested by Sourlas. We also discuss the application of the same method to more advanced codes of a similar type.

4 pages, 1 figures

References in corpus (2)

• Error-Correcting Codes That Nearly Saturate Shannon's Bound
• Finite-connectivity systems as error-correcting codes

Cited by in corpus (6)

• Parallel versus sequential updating for Belief Propagation decoding
• The Dynamic Phase Transition for Decoding Algorithms
• Dynamical replica analysis of disordered Ising spin systems on finitely connected random graphs
• Finite size effects and error-free communication in Gaussian channels
• Cavity approach to the Sourlas code system
• Survey propagation for the cascading Sourlas code