Statistical physics of error-correcting codes

  • Renato Vicente

    Student thesis: Doctoral ThesisDoctor of Philosophy

    Abstract

    In this thesis we use statistical physics techniques to study the typical performance of four families of error-correcting codes based on very sparse linear transformations: Sourlas codes, Gallager codes, MacKay-Neal codes and Kanter-Saad codes. We map the decoding problem onto an Ising spin system with many-spins interactions. We then employ the replica method to calculate averages over the quenched disorder represented by the code constructions, the arbitrary messages and the random noise vectors. We find, as the noise level increases, a phase transition between successful decoding and failure phases. This phase transition coincides with upper bounds derived in the information theory literature in most of the cases. We connect the practical decoding algorithm known as probability propagation with the task of finding local minima of the related Bethe free-energy. We show that the practical decoding thresholds correspond to noise levels where suboptimal minima of the free-energy emerge. Simulations of practical decoding scenarios using probability propagation agree with theoretical predictions of the replica symmetric theory. The typical performance predicted by the thermodynamic phase transitions is shown to be attainable in computation times that grow exponentially with the system size. We use the insights obtained to design a method to calculate the performance and optimise parameters of the high performance codes proposed by Kanter and Saad.
    Date of AwardOct 2000
    Original languageEnglish
    Awarding Institution
    • Aston University
    SupervisorDavid Saad (Supervisor) & Yoshiyuki Kabashima (Supervisor)

    Keywords

    • information theory
    • Ising systems
    • coding
    • approximate inference
    • statistical physics

    Cite this

    '