Finite size effects and error-free communication in Gaussian channels
arXiv:cond-mat/9907424 · doi:10.1088/0305-4470/33/8/311
Abstract
The efficacy of a specially constructed Gallager-type error-correcting code to communication in a Gaussian channel is being examined. The construction is based on the introduction of complex matrices, used in both encoding and decoding, which comprise sub-matrices of cascading connection values. The finite size effects are estimated for comparing the results to the bounds set by Shannon. The critical noise level achieved for certain code-rates and infinitely large systems nearly saturates the bounds set by Shannon even when the connectivity used is low.
References in corpus (3)
Cited by in corpus (10)
- 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
- Finite-Connectivity Spin-Glass Phase Diagrams and Low Density Parity Check Codes
- Statistical Physics of Irregular Low-Density Parity-Check Codes
- Statistical mechanical aspects of joint source-channel coding
- Secure and linear cryptosystems using error-correcting codes
- Survey propagation for the cascading Sourlas code
- An efficient joint source-channel coding for a D-dimensional array