Error-Correcting Codes That Nearly Saturate Shannon's Bound
arXiv:cond-mat/9906011 · doi:10.1103/PhysRevLett.83.2660
Abstract
Gallager-type error-correcting codes that nearly saturate Shannon's bound are constructed using insight gained from mapping the problem onto that of an Ising spin system. The performance of the suggested codes is evaluated for different code rates in both finite and infinite message length.
4 pages, 3 figures, submited to Phys. Rev. Lett
Cited by in corpus (32)
- Typical Performance of Gallager-type Error-Correcting Codes
- Exact solutions for diluted spin glasses and optimization problems
- Parallel versus sequential updating for Belief Propagation decoding
- The Statistical Physics of Regular Low-Density Parity-Check Error-Correcting Codes
- The Dynamic Phase Transition for Decoding Algorithms
- Error-correcting code on a cactus: a solvable model
- Simulation of many-body interactions by conditional geometric phases
- Phase Transitions in Quantum Pattern Recognition
- Cryptographical Properties of Ising Spin Systems
- Cascading Parity-Check Error-Correcting Codes
- Statistical Physics of Irregular Low-Density Parity-Check Codes
- Finite size effects and error-free communication in Gaussian channels
- Typical performance of low-density parity-check codes over general symmetric channels
- Generation of unpredictable time series by a Neural Network
- Statistical Mechanics Analysis of LDPC Coding in MIMO Gaussian Channels
- The Generalized Random Energy Model and its Application to the Statistical Physics of Ensembles of Hierarchical Codes
- High-Capacity Quantum Associative Memories
- Analysis of common attacks in LDPCC-based public-key cryptosystems
- Statistical mechanical aspects of joint source-channel coding
- Parallel vs. Sequential Belief Propagation Decoding of LDPC Codes over GF(q) and Markov Sources
- Statistical Mechanics and Capacity-Approaching Error-Correcting Codes
- The random energy model in a magnetic field and joint source-channel coding
- Code optimization, frozen glassy phase and improved decoding algorithms for low-density parity-check codes
- An Efficient MN-Algorithm for Joint Source-Channel Coding
- Secure and linear cryptosystems using error-correcting codes
- Survey propagation for the cascading Sourlas code
- Error-correcting codes on scale-free networks
- Renormalization Group Approach To Error-Correcting Codes
- An efficient joint source-channel coding for a D-dimensional array
- An identity of Chernoff bounds with an interpretation in statistical physics and applications in information theory
- Relations between random coding exponents and the statistical physics of random codes
- Statistical mechanical analysis of a hierarchical random code ensemble in signal processing