Fetching the paper…
Reading the bibliography…
Let X_1,...., X_n be a collection of iid discrete random variables, and Y_1,..., Y_m a set of noisy observations of such variables.
The detection of defective members of large populations
Robert Dorfman · 1943
Earlier work this paper cites.
Symmetric measures on Cartesian products
Edwin Hewitt and Leonard J. Savage · 1955
Earlier work this paper cites.
Low-Density Parity-Check Codes
Robert G. Gallager · 1963
Earlier work this paper cites.
Sulla prosequibilitá di processi aleatori scambiabili
Bruno de Finetti · 1969
Earlier work this paper cites.
On the inherent intractability of certain coding problems
Elwyn Berlekamp, Robert J. McEliecee, and Henk C.A. van Tilborg · 1978
Earlier work this paper cites.
Random multiple-access communication and group testing
Toby Berger, Nader Mehravari, Don Towsley, and Jack Wolf · 1984
Earlier work this paper cites.
Born again group testing: Multiaccess communications
Jack K. Wolf · 1985
Earlier work this paper cites.
Computational complexity of optimum multiuser detection
Sergio Verdú · 1989
Earlier work this paper cites.
Multiuser Detection
Sergio Verdu · 1998
Earlier work this paper cites.
Linear multiuser receivers: effective interference, effective bandwidth and user capacity
David N.C. Tse and Stephen V. Hanly · 1999
Earlier work this paper cites.
Spectral efficiency of CDMA with random spreading
Sergio Verdu and Shlomo Shamai · 1999
Earlier work this paper cites.
Factor Graphs and the Sum-Product Algorithm
Frank R. Kschischang, Brendan J. Frey, and H.-Andrea Loeliger · 2001
Earlier work this paper cites.
Statistical mechanics of linear compression codes in network communication
Tatsuto Murayama · 2001
Earlier work this paper cites.
LT codes
Michael Luby · 2002
Cited alongside, same era.
A statistical-mechanics approach to large-system analysis of cdma multiuser detectors
Toshyuki Tanaka · 2002
Cited alongside, same era.
New Directions in Traffic Measurement and Accounting: Focusing on the Elephants, Ignoring the Mice
Cristian Estan and George Varghese · 2003
Cited alongside, same era.
Noiseless data compression with low density parity check codes
Giuseppe Caire, Shlomo Shamai, and Sergio Verdú · 2004
Cited alongside, same era.
The high temperature region of the Viana-Bray diluted spin glass model
Francesco Guerra and Fabio L. Toninelli · 2004
Cited alongside, same era.
Near rate-distortion bound performance of sparse matrix codes
Tatsuto Murayama · 2004
Cited alongside, same era.
Asymptotic Mean-Square Optimality of Belief Propagation for Sparse Linear Systems
Dongning Guo and Chih-Chun Wang · 2006
Later among the works it cites.
Belief Propagation Is Asymptotically Equivalent to MAP Estimation for Sparse Linear Systems
Dongning Guo and Chih-Chun Wang · 2006
Later among the works it cites.
Sharp Bounds for MAP Decoding of General Irregular LDPC
Shrinivas Kudekar and Nicolas Macris · 2006
Later among the works it cites.
Analysis of Belief Propagation for Non-Linear Problems: The Example of CDMA (or: How to Prove Tanaka’s Formula)
Andrea Montanari and David Tse · 2006
Later among the works it cites.
The Parisi formula
Michel Talagrand · 2006
Later among the works it cites.
Analysis of Sparsely-Spread CDMA via Statistical Mechanics
Mika Yoshida and Toshiyuki Tanaka · 2006
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Randomly spread cdma: Asymptotics via statistical physics
Dongning Guo and Sergio Verdu · 2005
Cited alongside, same era.
The Generalized Area Theorem and Some of its Consequences
Cyril Méasson, Andrea Montanari, Tom Richardson, and Rüdiger Urbanke · 2005
Cited alongside, same era.
Maxwell Construction: The Hidden Bridge between Iterative and Maximum a Posteriori Decoding
Cyril Méasson, Andrea Montanari, and Rüdiger Urbanke · 2005
Cited alongside, same era.
Tight bounds for LDPC and LDGM codes under MAP decoding
Andrea Montanari · 2005
Cited alongside, same era.
Fundamentals of Wireless Communication
David Tse and Pramod Viswanath · 2005
Cited alongside, same era.
Compressed Sensing
David L. Donoho · 2006
Cited alongside, same era.
Later among the works it cites.
Reconstruction for models on random graphs
Antoine Gerschenfeld and Andrea Montanari · 2007
Closest in time.
Exact solution for the conditional entropy of Poissonian LDPC codes over the Binary Erasure Channel
Satish Babu Korada, Shrinivas Kudekar, and Nicolas Macris · 2007
Closest in time.
Detailed network measurements using sparse graph counters: The theory
Yi Lu, Andrea Montanari, and Balaji Prabhakar · 2007
Closest in time.
Griffith-Kelly-Sherman Correlation Inequalities: A Useful Tool in the Theory of Error Correcting Codes
Nicolas Macris · 2007
Closest in time.
Group testing with random pools: optimal two-stage algorithms
Marc Mézard and Cristina Toninelli · 2007
Closest in time.
Sparsely-Spread CDMA-a Statistical Mechanics Based Analysis
Jack Raymond and David Saad · 2007
Closest in time.
Modern Coding Theory
Tom Richardson and Rüdiger Urbanke · 2007
Closest in time.