Capacity-Achieving Sparse Superposition Codes via Approximate Message Passing Decoding
From MaRDI portal
Publication:5280847
DOI10.1109/TIT.2017.2649460zbMath1366.94609arXiv1501.05892MaRDI QIDQ5280847
Adam Greig, Ramji Venkataramanan, Cynthia Rush
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.05892
Related Items (6)
Sparse high-dimensional linear regression. Estimating squared error and a phase transition ⋮ Strong replica symmetry in high-dimensional optimal Bayesian inference ⋮ Universality of approximate message passing with semirandom matrices ⋮ An improved analysis of least squares superposition codes with Bernoulli dictionary ⋮ The all-or-nothing phenomenon in sparse linear regression ⋮ A Unifying Tutorial on Approximate Message Passing
This page was built for publication: Capacity-Achieving Sparse Superposition Codes via Approximate Message Passing Decoding
