Statistical mechanics of LDPC codes on channels with memory
arXiv:0907.0775 · doi:10.1088/1751-8113/47/38/385002
Abstract
We present an analytic method of assessing the typical performance of low-density parity-check codes on finite-state Markov channels. We show that this problem is similar to a spin-glass model on a `small-world' lattice. We apply our methodology to binary-symmetric and binary-asymmetric channels and we provide the critical noise levels for different degrees of channel symmetry.
6 pages, 4 figures
References in corpus (12)
- Kuramoto model of synchronization: Equilibrium and nonequilibrium aspects
- Tight bounds for LDPC and LDGM codes under MAP decoding
- Replicated Transfer Matrix Analysis of Ising Spin Models on `Small World' Lattices
- Density Evolution for Asymmetric Memoryless Channels
- Finite-Connectivity Spin-Glass Phase Diagrams and Low Density Parity Check Codes
- Gallager error correcting codes for binary asymmetric channels
- Replica symmetry breaking in the `small world' spin glass
- Statistical mechanics of error exponents for error-correcting codes
- Diagonalization of replicated transfer matrices for disordered Ising spin systems
- Thermodynamics of spin systems on small-world hypergraphs
- Small-world hypergraphs on a bond-disordered Bethe lattice
- Statistical Mechanical Analysis of Low-Density Parity-Check Codes on General Markov Channel