Weighted Euclidean superimposed codes for integer compressed sensing

2008 IEEE Information Theory Workshop, ITW

Volumn , Issue , 2008, Pages 124-128

  Dai, Wei ^a   Milenkovic, Olgica ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; CODES (SYMBOLS); CYBERNETICS; DECODING; INFORMATION THEORY; PROGRAMMING THEORY; SIGNAL RECONSTRUCTION;

ANALYTICAL TOOLS; CODE-WORDS; COMPRESSED SENSING; DECODING ALGORITHMS; EUCLIDEAN; IDENTIFICATION SYSTEMS; LINEAR COMBINATIONS; LOW-COMPLEXITY; LOWER AND UPPER BOUNDS; MULTI USERS; SUPERIMPOSED CODING;

CODES (STANDARDS);

EID: 51849139495     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2008.4578635     Document Type: Conference Paper

References (10)

1. W. Kautz and R. Singleton, "Nonrandom binary superimposed codes," IEEE Trans. Inform. Theory, vol. 10, no. 4, pp. 363-377, 1964.
2. n," IEEE Trans. Inform. Theory, vol. 34, no. 4, pp. 877-880, 1988.
3. Z. Füredi and M. Ruszinkó, "An improved upper bound of the rate of Euclidean superimposed codes," IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 799-802, 1999.
4. D. Donoho, "Compressed sensing," IEEE Trans. Inform. Theory, vol. 52, no. 4, pp. 1289-1306, 2006.
5. E. 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.
6. E. J. Candès and T. Tao, "Near-optimal signal recovery from random projections: Universal encoding strategies?" IEEE Trans. Inform. Theory, vol. 52, no. 12, pp. 5406-5425, 2006.
7. G. Cormode and S. Muthukrishnan, "What's hot and what's not: Tracking most frequent items dynamically," IEEE Trans. Inform. Theory, vol. 50, no. 10, pp. 2231-2242, 2004.
8. M. Sheikh, O. Milenkovic, and R. Baraniuk, "Designing compressive sensing DNA microarrays," Proceedings of the IEEE Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), St. Thomas, U.S. Virgin Islands, submitted, Dec. 2007.
9. A. Barvinok, A Course in Convexity. American Mathematical Society, 2002.
10. J. A. Tropp and A. C. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit," submitted.