14 references, page 1 of 2 [1] D. L. Donoho, “Compressed sensing,” IEEE Trans. Inf. Theory, vol. 52, pp. 1289-1306, Apr. 2006.

[2] A. G. Dimakis, R. Smarandache, and P. O. Vontobel, “LDPC codes for compressed sensing,” IEEE Trans. Inf. Theory, vol. 58, pp. 3093-3114, May 2012.

[3] 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, pp. 414-419.

[4] --, “Verification decoding of high-rate LDPC codes with applications in compressed sensing,” IEEE Trans. Inf. Theory, vol. 58, pp. 5042- 5058, Aug. 2012.

[5] W. Xu and B. Hassibi, “Efficient compressive sensing with deterministic guarantees using expander graphs,” in Proc. 2007 IEEE Inform. Theory Workshop., Lake Tahoe, CA,, Sep. 2007, pp. 414-419.

[6] Y. Eftekhari, A. Heidarzadeh, A. H. Banihashemi, and I. Lambadaris, “Density evolution analysis of node-based verification-based algorithms in compressed sensing,” IEEE Trans. Inf. Theory, vol. 58, pp. 6616- 6645, Oct. 2012.

[7] 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, Jul. 2006, pp. 2804-2808.

[8] D. L. Donoho, A. Maleki, and A. Montanari, “Message passing algorithms for compressed sensing,” Proc. Nat. Acad. Sci., vol. 106, pp. 18 914-18 919, 2009.

[9] F. Ramirez-Javega, M. Lamarca, and J. Villare, “Binary graphs and message passing strategies for compressed sensing in the noiseless setting,” in Proc. IEEE Int.Symp. Information Theory, Combridge, MA, Jul. 2012, pp. 1867-1871.

[10] M. Luby and M. Mitzenmacher, “Verification-based decoding for packetbased low-density parity-check codes,” IEEE Trans. Inf. Theory, vol. 51, pp. 120-127, Jan. 2005.