Compressed sensing and linear codes over real numbers

2008 Information Theory and Applications Workshop - Conference Proceedings, ITA

Volumn , Issue , 2008, Pages 558-561

  Zhang, Fan ^a   Pfister, Henry D ^a  

^a Department of Electrical and Computer Engineering

Author keywords

[No Author keywords available]

Indexed keywords

CODING THEORY; COMPRESSED SENSING; ERROR-CORRECTING CODES; LINEAR CODING; REAL NUMBERS; RECONSTRUCTION METHODS; SOURCE CODING; SPARSE VECTORS;

ARTIFICIAL INTELLIGENCE; CODES (STANDARDS); COMPUTER PROGRAMMING; CYBERNETICS; ERROR ANALYSIS; HEALTH; INFORMATION THEORY; NUMBER THEORY; PROGRAMMING THEORY; REPAIR; RESTORATION; SIGNAL PROCESSING; SIGNAL RECONSTRUCTION;

CODES (SYMBOLS);

EID: 52949122164     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITA.2008.4601055     Document Type: Conference Paper

References (23)

1. T. Ancheta Jr. Syndroine-source-coding and its universal generalization. IEEE Trans. Inform.. Theory, 22(4):432-436, 1976.
2. E. J. Candes, J. Romberg, and T. Tao. Robust uncertainty principles: exact, signal reconstruction from highly incomplete frequency information. IEEE Trans. Inform. Theory, 52(2):489-509, 2006.
3. E. J. Candès and T. Tao. Decoding by linear programming. IEEE Trans. Inform. Theory, 51(12):4203-4215, 2005.
4. S. Chen, D. Donoho, and M. Saunders. Atomic decomposition by basis pursuit. SIAM J. Sci. Comp., 20(1):33-61, 1998.
5. D. L. Donoho. Compressed sensing. IEEE Trans. Inform. Theory, 52(4):1289-1306, 2006.
6. D. L. Donoho and X. Huo. Uncertainty principles and ideal atomic decomposition. IEEE Trans. Inform. Theory, 47(7):2845-2862, Nov. 2001.
7. C. Douillard, M. Jézéquel, C. Berrou, A. Picart, P. Didier, and A. Glavieux. Iterative correction of intersymbol interference: Turbo equalization. Eur. Trans. Telecom., 6(5):507-511, Sept. - Oct. 1995.
8. M. Duarte, S. Sarvotham, D. Baron, M. Wakin, and R. Baraniuk. Distributed compressed sensing of jointly sparse signals. In Proc. Asilomar Conf. on Signals, Systems & Computers, 2005.
9. R. G. Gallager. Low-Density Parity-Check Codes. The M.I.T. Press, Cambridge, MA, USA, 1963.
10. R. G. Gallager. Information Theory and Reliable Communication. Wiley, New York, NY, USA, 1968.
11. B. S. Kashin and V. N. Temiyakov. A remark on compressed sensing. Mathematical Notes, 82(5):748-755, 2007.
12. M. Luby and M. Mitzenmacher. Verification-based decoding for packet-based low-density parity-check codes. IEEE Trans. Inform. Theory, 51(1):120-127, 2005.
13. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman. Efficient erasure correcting codes. IEEE Trans. Inform. Theory, 47(2):569-584, Feb. 2001.
14. T. J. Richardson and R. L. Urbanke. The capacity of low-density parity-check codes under message-passing decoding. IEEE Trans. Inform. Theory, 47(2):599-618, Feb. 2001.
15. S. Sarvotham, D. Baron, and R. G. Baraniuk. Measurements vs. bits: Compressed sensing meets information theory. In Proc. 45th Annual Allerton Conf. on Commun., Control, and Comp., Monticello, IL, Sept. 2006.
16. S. Sarvotham, D. Baron, and R. G. Baraniuk. Sudocodes-fast measurement and reconstruction of sparse signals, pages 2804-2808, July 2006.
17. A. M. Shokrollahi and W. Wang. Low-density parity-check codes with rates very close to the capacity of the q-ary symmetric channel for large q. In Proc. IEEE Int. Symp. Information Theory, page 275, Chicago, IL, June 2004.
18. D. Slepian and J. K. Wolf. Noiseless coding of correlated information sources. IEEE Trans. Inform. Theory, 19(4):471-480, July 1973.
19. J. A. Tropp and A. C. Gilbert. Signal recovery from random measurements via orthogonal, matching pursuit. IEEE Trans. Inform. Theory, 53(12):4655-4666, 2007.
20. J. K. Wolf. Redundancy, the discrete Fourier transform, and impulse noise cancellation. IEEE Trans. Commun., 31(3):458-461, March 1983.
21. A. Wyner. Recent results in the Shannon theory. IEEE Trans. Inform. Theory, 20(1):2-10, 1974.
22. W Xu and B. Hassibi. Efficient compressive sensing with deterministic guarantees using expander graphs. In Proc. IEEE Inform. Theory Workshop, pages 414-419, Lake Tahoe, CA, Sept. 2007.
23. F. Zhang and H. D. Pfister. List-message passing achieves capacity on the q-ary symmetric channel for large q. In Proc. IEEE Global Telecom. Conf, Washington, DC, Nov. 2007.