Tight Bounds for LDPC and LDGM Codes Under MAP Decoding
From MaRDI portal
Publication:3547394
DOI10.1109/TIT.2005.853320zbMath1310.94216arXivcs/0407060OpenAlexW3099994871MaRDI QIDQ3547394
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0407060
Disordered systems (random Ising models, random Schrödinger operators, etc.) in equilibrium statistical mechanics (82B44) Combinatorial codes (94B25) Decoding (94B35)
Related Items (11)
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 ⋮ Information-theoretic thresholds from the cavity method ⋮ 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 ⋮ Right-convergence of sparse random graphs ⋮ Replica bounds by combinatorial interpolation for diluted spin systems ⋮ Combinatorial approach to the interpolation method and scaling limits in sparse random graphs ⋮ Unnamed Item ⋮ The adaptive interpolation method: a simple scheme to prove replica formulas in Bayesian inference
This page was built for publication: Tight Bounds for LDPC and LDGM Codes Under MAP Decoding
