Generalized Approximate Message-Passing Decoder for Universal Sparse Superposition Codes

D. L. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,” Proceedings of the National Academy of Sciences , vol. 106, no. 45, pp. 18 914–18 919, 2009

2009

Earlier work this paper cites.

A. Barron and A. Joseph, “Toward fast reliable communication at rates near capacity with gaussian noise,” in Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on , June 2010, pp. 315–319

2010

Earlier work this paper cites.

M. Bayati and A. Montanari, “The dynamics of message passing on dense graphs, with applications to compressed sensing,” IEEE Transactions on Information Theory , vol. 57, no. 2, pp. 764–785, 2011

2011

Earlier work this paper cites.

A. R. Barron and S. Cho, “High-rate sparse superposition codes with iteratively optimal estimates,” in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on . IEEE, 2012, pp. 120–124

2012

Earlier work this paper cites.

F. Krzakala, M. Mézard, F. Sausset, Y. Sun, and L. Zdeborová, “Probabilistic reconstruction in compressed sensing: Algorithms, phase diagrams, and threshold achieving matrices,” Journal of Statistical Mechanics: Theory and Experiment , vol. P08009, 2012

2012

Earlier work this paper cites.

S. Rangan, “Generalized approximate message passing for estimation with random linear mixing,” arXiv preprint arXiv:1010.5141 , 2012

Original

2012

Earlier work this paper cites.

A. Javanmard and A. Montanari, “State evolution for general approximate message passing algorithms, with applications to spatial coupling,” Information and Inference , 2013

2013

Cited alongside, same era.

S. Kudekar, T. Richardson, and R. L. Urbanke, “Spatially coupled ensembles universally achieve capacity under belief propagation,” IEEE Trans. on Information Theory , vol. 59, no. 12, pp. 7761–7813, Dec 2013

Original

2013

Cited alongside, same era.

A. Joseph and A. R. Barron, “Fast sparse superposition codes have near exponential error probability for R<C,” IEEE Tans. on Information Theory , vol. 60, no. 2, pp. 919–942, 2014

2014

Cited alongside, same era.

J. Barbier and F. Krzakala, “Replica analysis and approximate message passing decoder for superposition codes,” in Information Theory Proceedings (ISIT), 2014 IEEE International Symposium on , 2014

2014

Cited alongside, same era.

J. Barbier and F. Krzakala, “Approximate message-passing decoder and capacity-achieving sparse superposition codes,” arXiv preprint arXiv:1503.08040 , 2015

Original

2015

Later among the works it cites.

C. Condo and W. J. Gross, “Sparse superposition codes: A practical approach,” in Signal Processing Systems (SiPS), 2015 IEEE Workshop on , Oct 2015, pp. 1–6

2015

Later among the works it cites.

J. Barbier, M. Dia, and N. Macris, “Threshold Saturation of Spatially Coupled Sparse Superposition Codes for All Memoryless Channels,” in Information Theory workshop (ITW), 2016 IEEE , 2016

2016

Later among the works it cites.

J. Barbier, M. Dia, and N. Macris, “Proof of Threshold Saturation for Spatially Coupled Sparse Superposition Codes,” in Information Theory Proceedings (ISIT), 2016 IEEE International Symposium on , 2016

2016

Later among the works it cites.