Fetching the paper…
Reading the bibliography…
This paper considers the performance of $(j,k)$-regular low-density parity-check (LDPC) codes with message-passing (MP) decoding algorithms in the high-rate regime.
R. G. Gallager, “Low-density parity-check codes,” IEEE Trans. Inform. Theory , vol. 8, no. 1, pp. 21–28, Jan. 1962
1962
Earlier work this paper cites.
R. G. Gallager, Low-Density Parity-Check Codes . Cambridge, MA, USA: The M.I.T. Press, 1963
1963
Earlier work this paper cites.
J. K. Wolf, “Redundancy, the discrete Fourier transform, and impulse noise cancellation,” IEEE Trans. Commun. , vol. 31, no. 3, pp. 458–461, March 1983
1983
Earlier work this paper cites.
W. Johnson and J. Lindenstrauss, “Extensions of lipschitz maps into hilbert space,” Contemp. Math. , vol. 26, pp. 189–206, 1984
1984
Earlier work this paper cites.
E. D. Gluskin, “Norms of random matrices and widths of finite-dimensional sets,” Math. USSR Sbornik , vol. 48, pp. 173–182, 1984
1984
Earlier work this paper cites.
J. J. Metzner, “Majority-logic-like decoding of vector symbols,” vol. 44, pp. 1227–1230, Oct. 1996
1996
Earlier work this paper cites.
R. Corless, G. Gonnet, D. Hare, D. Jeffrey, and D. Knuth, “On the Lambert W function,” Advances in Computational mathematics , vol. 5, no. 1, pp. 329–359, 1996
1996
Earlier work this paper cites.
M. G. Luby, M. Mitzenmacher, and M. A. Shokrollahi, “Practical loss-resilient codes,” in Proc. 29th Annu. ACM Symp. Theory of Computing , 1997, pp. 150–159
1997
Earlier work this paper cites.
S. Chen, D. Donoho, and M. Saunders, “Atomic decomposition by basis pursuit,” SIAM J. Sci. Comp. , vol. 20, no. 1, pp. 33–61, 1998
1998
Earlier work this paper cites.
M. Davey and D. MacKay, “Low density parity check codes over GF( q q ),” vol. 2, pp. 58–60, 1998
1998
Earlier work this paper cites.
D. J. C. MacKay, “Good error-correcting codes based on very sparse matrices,” IEEE Trans. Inform. Theory , vol. 45, no. 2, pp. 399–431, March 1999
1999
Earlier work this paper cites.
M. A. Shokrollahi, “New sequences of linear time erasure codes approaching the channel capacity,” in Applicable Algebra in Eng., Commun. Comp. , 1999, pp. 65–76
1999
Earlier work this paper cites.
T. Richardson, M. A. Shokrollahi, and R. Urbanke, “Design of capacity-approaching irregular low-density parity-check codes,” IEEE Trans. Inform. Theory , vol. 47, pp. 619–637, Feb. 2001
2001
Earlier work this paper cites.
M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, “Efficient erasure correcting codes,” IEEE Trans. Inform. Theory , vol. 47, no. 2, pp. 569–584, Feb. 2001
2001
Earlier work this paper cites.
S. ten Brink, “Convergence behavior of iteratively decoded parallel concatenated codes.” IEEE Trans. Inform. Theory , vol. 49, pp. 1727–1737, Oct. 2001
2001
Earlier work this paper cites.
T. Richardson and R. Urbanke, “The capacity of low-density parity-check codes under message-passing decoding,” IEEE Trans. Inform. Theory , vol. 47, pp. 599–618, Feb. 2001
2001
Earlier work this paper cites.
C. Di, D. Proietti, E. Telatar, T. J. Richardson, and R. Urbanke, “Finite-length analysis of low-density parity-check codes on the binary erasure channel,” IEEE Trans. Inform. Theory , vol. 48, no. 6, pp. 1570–1579, June 2002
2002
Earlier work this paper cites.
M. Luby, “Lt codes,” in Proc. of the 43rd Symp. on Foundations of Comp. Sci. , Washington, D.C., June 2002, p. 271
2002
Earlier work this paper cites.
G. Cormode and S. Muthukrishnan, “An improved data stream summary: the count-min sketch and its applications,” Journal of Algorithms , vol. 55, no. 1, p. 75, 2005
2005
Cited alongside, same era.
M. Luby and M. Mitzenmacher, “Verification-based decoding for packet-based low-density parity-check codes,” IEEE Trans. Inform. Theory , vol. 51, no. 1, pp. 120–127, 2005
2005
Cited alongside, same era.
D. Donoho and J. Tanner, “Neighborliness of randomly projected simplices in high dimensions,” Proc. Natl. Acad. Sci. U. S. A. , vol. 102, no. 27, pp. 9452–9457, 2005
2005
Cited alongside, same era.
D. Baron, M. Wakin, M. Duarte, S. Sarvotham, and R. Baraniuk, “Distributed compressed sensing,” 2005, preprint
2005
Cited alongside, same era.
A. Orlitsky, K. Viswanathan, and J. Zhang, “Stopping set distribution of LDPC code ensembles,” IEEE Trans. Inform. Theory , vol. 51, no. 3, pp. 929–953, 2005
F. Zhang and H. D. Pfister, “Compressed sensing and linear codes over real numbers,” in Proc. 2008 Workshop on Inform. Theory and Appl. , UCSD, La Jolla, CA, Feb. 2008
2008
Later among the works it cites.
——, “On the iterative decoding of high rate LDPC codes with applications in compressed sensing,” in Proc. 46th Annual Allerton Conf. on Commun., Control, and Comp. , Monticello, IL, Sept. 2008
2008
Later among the works it cites.
W. Dai and O. Milenkovic, “Weighted superimposed codes and constrained integer compressed sensing,” 2008, submitted to IEEE Trans. on Inform. Theory
2008
Later among the works it cites.
R. Berinde and P. Indyk, “Sparse recovery using sparse matrices,” in MIT-CSAIL Technical Report, , 2008
2008
Later among the works it cites.
R. Berinde, A. Gilbert, P. Indyk, H. Karloff, and M. Strauss, “Combining geometry and combinatorics: A unified approach to sparse signal recovery,” in Proc. 46th Annual Allerton Conf. on Commun., Control, and Comp. , Monticello, IL, 2008
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2005
Cited alongside, same era.
E. J. Candès and T. Tao, “Decoding by linear programming,” IEEE Trans. Inform. Theory , vol. 51, no. 12, pp. 4203–4215, 2005
2005
Cited alongside, same era.
D. L. Donoho, “Compressed sensing,” IEEE Trans. Inform. Theory , vol. 52, no. 4, pp. 1289–1306, 2006
2006
Cited alongside, same era.
E. J. Candès, J. Romberg, and T. Tao, “Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information,” IEEE Trans. Inform. Theory , vol. 52, no. 2, pp. 489–509, 2006
2006
Cited alongside, same era.
A. Cohen, W. Dahmen, and R. DeVore, “Compressed sensing and best k-term approximation,” IGPM Report, RWTH-Aachen , July 2006
2006
Cited alongside, same era.
S. Sarvotham, D. Baron, and R. G. Baraniuk, “Sudocodes–fast measurement and reconstruction of sparse signals,” in Proc. IEEE Int. Symp. Information Theory , Seattle, WA, July 2006, pp. 2804–2808
2006
Cited alongside, same era.
S. Sarvotham, D. Baron, and R. Baraniuk, “Compressed sensing reconstruction via belief propagation,” Rice University, Tech. Rep. ECE-06-01, July 2006
2006
Cited alongside, same era.
D. Donoho, “High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension,” Discrete and Computational Geometry , vol. 35, no. 4, pp. 617–652, 2006
2006
Cited alongside, same era.
2008
Later among the works it cites.
Y. Lu, A. Montanari, and B. Prabhakar, “Counter braids: Asymptotic optimality of the message passing decoding algorithm,” in Proc. 46th Annual Allerton Conf. on Commun., Control, and Comp. , Monticello, IL, 2008
2008
Later among the works it cites.
2008
Later among the works it cites.
R. Chartrand and W. Yin, “Iteratively reweighted algorithms for compressive sensing,” in Acoustics, Speech and Signal Processing, 2008. ICASSP 2008. IEEE International Conference on , 2008, pp. 3869–108
2008
Later among the works it cites.
D. Donoho, A. Maleki, and A. Montanari, “Message-passing algorithms for compressed sensing,” Proc. Natl. Acad. Sci. U. S. A. , vol. 106, no. 45, pp. 18 914–18 919, 2009
2009
Closest in time.
M. A. Khajehnejad, A. G. Dimakis, W. Xu, and B. Hassibi, “Sparse recovery of positive signals with minimal expansion,” 2009, available in Arxiv preprint cs.IT/0902.4045v1
2009
Closest in time.
D. Needell and R. Vershynin, “Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit,” Foundations of Computational Mathematics , vol. 9, no. 3, pp. 317–334, June 2009
2009
Closest in time.
D. Baron, S. Sarvotham, and R. Baraniuk, “Bayesian compressive sensing via belief propagation,” IEEE Trans. Signal Processing , vol. 58, no. 1, pp. 269–280, 2010
2010
Closest in time.
——, “Message passing algorithms for compressed sensing: I. motivation and construction,” Proc. IEEE Inform. Theory Workshop , pp. 1–5, Jan. 2010
2010
Closest in time.
——, “Message passing algorithms for compressed sensing: Ii. analysis and validation,” Proc. IEEE Inform. Theory Workshop , pp. 1–5, Jan. 2010
2010
Closest in time.
A. Gilbert and P. Indyk, “Sparse recovery using sparse matrices,” in Proceedings of the IEEE , June 2010, pp. 937–947
2010
Closest in time.
K. D. Ba, P. Indyk, E. Price, and D. P. Woodruff, “Lower bounds for sparse recovery,” in Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, Austin, Texas, USA, January 17-19 , 2010, pp. 1190–1197
2010
Closest in time.
R. P. Boas, Invitation to Complex Analysis . Mathematical Association of America, 2010
2010
Closest in time.
F. Zhang and H. D. Pfister, “Analysis of verification-based decoding on the q q -ary symmetric channel for large q q ,” IEEE Trans. Inform. Theory , vol. 57, no. 10, pp. 6754–6770, Oct. 2011
2011
Closest in time.