Approximate Message-Passing Decoder and Capacity Achieving Sparse Superposition Codes

DOI10.1109/TIT.2017.2713833zbMath1372.94387arXiv1503.08040OpenAlexW1909826856WikidataQ59460014 ScholiaQ59460014MaRDI QIDQ5369844

Jean Barbier, Florent Krzakala

Publication date: 19 October 2017

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

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

Mathematics Subject Classification ID

Decoding (94B35) Source coding (94A29)

Related Items (6)

Strong replica symmetry in high-dimensional optimal Bayesian inference ⋮ Approximate message passing for nonconvex sparse regularization with stability and asymptotic analysis ⋮ An improved analysis of least squares superposition codes with Bernoulli dictionary ⋮ The all-or-nothing phenomenon in sparse linear regression ⋮ The committee machine: computational to statistical gaps in learning a two-layers neural network ⋮ A Unifying Tutorial on Approximate Message Passing

This page was built for publication: Approximate Message-Passing Decoder and Capacity Achieving Sparse Superposition Codes