Sharp Bounds for Optimal Decoding of Low-Density Parity-Check Codes

DOI10.1109/TIT.2009.2027523zbMath1367.94431arXiv0807.3065MaRDI QIDQ4974023

Shrinivas Kudekar, Nicolas Macris

Publication date: 8 August 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0807.3065

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (7)

Exact solution of the gauge symmetric \(p\)-spin glass model on a complete graph ⋮ The adaptive interpolation method for proving replica formulas. Applications to the Curie–Weiss and Wigner spike models ⋮ Strong replica symmetry in high-dimensional optimal Bayesian inference ⋮ Information theoretic limits of learning a sparse rule ⋮ On the concentration of the number of solutions of random satisfiability formulas ⋮ Concentration of multi-overlaps for random dilute ferromagnetic spin models ⋮ The adaptive interpolation method: a simple scheme to prove replica formulas in Bayesian inference

This page was built for publication: Sharp Bounds for Optimal Decoding of Low-Density Parity-Check Codes