Low density parity check codes: a statistical physics perspective

Renato Vicente, David Saad, Yoshiyuki Kabashima

    Research output: Chapter in Book/Published conference outputChapter (peer-reviewed)peer-review


    The modem digital communication systems are made transmission reliable by employing error correction technique for the redundancies. Codes in the low-density parity-check work along the principles of Hamming code, and the parity-check matrix is very sparse, and multiple errors can be corrected. The sparseness of the matrix allows for the decoding process to be carried out by probability propagation methods similar to those employed in Turbo codes. The relation between spin systems in statistical physics and digital error correcting codes is based on the existence of a simple isomorphism between the additive Boolean group and the multiplicative binary group. Shannon proved general results on the natural limits of compression and error-correction by setting up the framework known as information theory. Error-correction codes are based on mapping the original space of words onto a higher dimensional space in such a way that the typical distance between encoded words increases.
    Original languageEnglish
    Title of host publicationAdvances in electronics and electron physics
    EditorsPeter W. Hawkes
    Number of pages123
    ISBN (Electronic)978-0-12-804815-3
    ISBN (Print)978-0-12014767-0, 012014767X
    Publication statusPublished - 2002

    Publication series

    NameAdvances in Imaging and Electron Physics
    ISSN (Print)1076-5670

    Bibliographical note

    Copyright of Academic Press part of Elsevier Science


    • error-corrective codes
    • replica-symmetry-breaking
    • random energy model
    • finite-connectivity systems
    • spin-glasses
    • belief propagation
    • sparse matrices
    • solvable model
    • turbo codes
    • phase


    Dive into the research topics of 'Low density parity check codes: a statistical physics perspective'. Together they form a unique fingerprint.

    Cite this