Gallager error-correcting codes for binary asymmetric channels
From MaRDI portal
Publication:5239441
Abstract: We derive critical noise levels for Gallager codes on asymmetric channels as a function of the input bias and the temperature. Using a statistical mechanics approach we study the space of codewords and the entropy in the various decoding regimes. We further discuss the relation of the convergence of the message passing algorithm with the endogeny property and complexity, characterizing solutions of recursive equations of distributions for cavity fields.
Recommendations
- Weight vs. Magnetization Enumerator for Gallager Codes
- Performance of low density parity check codes as a function of actual and assumed noise levels
- Statistical mechanics of low-density parity-check codes
- Exact Thresholds and Optimal Codes for the Binary-Symmetric Channel and Gallager's Decoding Algorithm A
- Good error-correcting codes based on very sparse matrices
Cites work
- scientific article; zbMATH DE number 3174791 (Why is no real title available?)
- scientific article; zbMATH DE number 1273988 (Why is no real title available?)
- scientific article; zbMATH DE number 3251924 (Why is no real title available?)
- A Mathematical Theory of Communication
- A survey of max-type recursive distributional equations
- Average and reliability error exponents in low-density parity-check codes
- Density Evolution for Asymmetric Memoryless Channels
- Design of capacity-approaching irregular low-density parity-check codes
- Errata for "good error-correcting codes based on very sparse matrices"
- Good error-correcting codes based on very sparse matrices
- On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels
- On the inherent intractability of certain coding problems (Corresp.)
- Optimization problems and replica symmetry breaking in finite connectivity spin glasses
- Polynomial Codes Over Certain Finite Fields
- Statistical Physics of Spin Glasses and Information Processing
- Statistical mechanics of low-density parity-check codes
- Statistical physics of irregular low-density parity-check codes
- Survey propagation at finite temperature: application to a Sourlas code as a toy model
- Survey propagation for the cascading Sourlas code
- Survey propagation: An algorithm for satisfiability
- The Nishimori line and Bayesian statistics
- The capacity of low-density parity-check codes under message-passing decoding
- Two solutions to diluted p-spin models and XORSAT problems
- Typical performance of regular low-density parity-check codes over general symmetric channels
- Universality classes for extreme-value statistics
Cited in
(8)- On transform-domain error and erasure correction by Gabidulin codes
- Evaluation of the performance of error-correcting codes on a Gilbert channel
- Parameters of Codes for the Binary Asymmetric Channel
- The phase diagram of Lévy spin glasses
- Lowering the error floor of Gallager codes: a statistical-mechanical view
- Weight vs. Magnetization Enumerator for Gallager Codes
- Performance of LDPC Decoding Algorithms with a Statistical Physics Theory Approach
- On optimal codes for binary asymmetric channels (Corresp.)
This page was built for publication: Gallager error-correcting codes for binary asymmetric channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5239441)
