Fetching the paper…
Reading the bibliography…
Consider random linear estimation with Gaussian measurement matrices and noise.
S. Verdú and S. Shamai, “Spectral efficiency of cdma with random spreading,” IEEE Trans. on Information Theory , 1999
1999
Earlier work this paper cites.
T. Tanaka, “A statistical-mechanics approach to large-system analysis of cdma multiuser detectors,” IEEE Trans. on Information Theory , 2002
2002
Earlier work this paper cites.
D. Guo, S. Shamai, and S. Verdu, “Mutual information and minimum mean-square error in gaussian channels,” IEEE Trans. on Information Theory , vol. 51, no. 4, pp. 1261–1282, April 2005
2005
Earlier work this paper cites.
D. Guo and S. Verdú, “Randomly spread cdma: asymptotics via statistical physics,” IEEE Trans. on Information Theory , vol. 51, no. 6, pp. 1983–2010, May 2005
2005
Earlier work this paper cites.
F. Guerra, “An introduction to mean field spin glass theory: methods and results,” Mathematical Statistical Physics , 2005
2005
Earlier work this paper cites.
E. J. Candes and T. Tao, “Near-optimal signal recovery from random projections: Universal encoding strategies?” IEEE Trans. on Information Theory , 2006
2006
Earlier work this paper cites.
A. Montanari and D. Tse, “Analysis of belief propagation for non-linear problems: The example of cdma (or: How to prove tanaka’s formula),” in 2006 IEEE Information Theory Workshop (ITW) Punta del Este , March 2006, pp. 160–164
2006
Earlier work this paper cites.
S. Korada and N. Macris, “On the capacity of a code division multiple access system,” in Proc. Allerton Conf. Commun. Control Comput., Monticello, IL , September 2007, pp. 959–966
2007
Earlier work this paper cites.
M. Payaro and D. P. Palomar, “Hessian and concavity of mutual information, differential entropy, and entropy power in linear vector gaussian channels,” IEEE Trans. on Information Theory , vol. 55, no. 8, pp. 3613–3628, Aug 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 , 2010
2010
Earlier work this paper cites.
S. B. Korada and N. Macris, “Tight bounds on the capacity of binary input random cdma systems,” IEEE Trans. on Information Theory , vol. 56, no. 11, pp. 5590–5613, Nov 2010
2010
Cited alongside, same era.
S. Kudekar and H. D. Pfister, “The effect of spatial coupling on compressive sensing,” in Communication, Control, and Computing, 2010 48th Annual Allerton Conference on , 2010
2010
Cited alongside, same era.
S. Hassani, N. Macris, and R. Urbanke, “Coupled graphical models and their thresholds,” in Information Theory Workshop (ITW), 2010
2010
Cited alongside, same era.
S. Kudekar, T. Richardson, and R. Urbanke, “Threshold saturation via spatial coupling: Why convolutional ldpc ensembles perform so well over the bec,” IEEE Trans. on Information Theory , 2011
2011
Cited alongside, same era.
G. K. Atia and V. Saligrama, “Boolean compressed sensing and noisy group testing,” IEEE Trans. on Information Theory , 2012
D. Donoho, A. Javanmard, and A. Montanari, “Information-theoretically optimal compressed sensing via spatial coupling and approximate message passing,” IEEE Trans. on Information Theory , vol. 59, no. 11, pp. 7434–7464, November 2013
2013
Later among the works it cites.
2013
Later among the works it cites.
S. Kumar, A. J. Young, N. Macris, and H. D. Pfister, “Threshold saturation for spatially coupled ldpc and ldgm codes on bms channels,” IEEE Trans. on Information Theory , 2014
2014
Later among the works it cites.
G. Reeves and H. D. Pfister, “The replica-symmetric prediction for compressed sensing with gaussian matrices is exact,” in 2016 IEEE International Symposium on Information Theory (ISIT) , July 2016
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2012
Cited alongside, same era.
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. 2012, no. 08, p. P08009, 2012
2012
Cited alongside, same era.
A. Yedla, Y. Y. Jian, P. S. Nguyen, and H. D. Pfister, “A simple proof of threshold saturation for coupled scalar recursions,” in Turbo Codes and Iterative Information Processing (ISTC), 2012 7th International Symposium on , 2012
2012
Cited alongside, same era.
A. Giurgiu, N. Macris, and R. Urbanke, “How to prove the maxwell conjecture via spatial coupling: a proof of concept,” in Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on , July 2012, pp. 458–462
2012
Cited alongside, same era.
A. M. Tulino, G. Caire, S. Verdú, and S. S. (Shitz), “Support recovery with sparsely sampled free random matrices,” IEEE Trans. on Information Theory , vol. 59, no. 7, pp. 4243–4271, July 2013
2013
Cited alongside, same era.
Cited in the paper.
J. Barbier, M. Dia, N. Macris, and F. Krzakala, “The Mutual Information in Random Linear Estimation,” in in the 54th Annual Allerton Conference on Communication, Control, and Computing , September 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
A. Giurgiu, N. Macris, and R. Urbanke, “Spatial coupling as a proof technique and three applications,” IEEE Trans. on Information Theory , vol. 62, no. 10, pp. 5281–5295, Oct 2016
2016
Later among the works it cites.
J. Barbier, M. Dia, N. Macris, F. Krzakala, T. Lesieur, and L. Zdeborová, “Mutual information for symmetric rank-one matrix estimation: A proof of the replica formula,” in Advances in Neural Information Processing Systems (NIPS) 29 , 2016, pp. 424–432
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.