Weighted superimposed codes and constrained integer compressed sensing

IEEE Transactions on Information Theory

Volumn 55, Issue 5, 2009, Pages 2215-2229

  Dai, Wei ^a   Milenkovic, Olgica ^a  

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

Author keywords

Code exponent; Compressive sensing; Random coding bound; Sphere packing bound; Superimposed codes

Indexed keywords

CODE EXPONENT; COMPRESSIVE SENSING; RANDOM CODING BOUND; SPHERE-PACKING BOUND; SUPERIMPOSED CODES;

CHANNEL CAPACITY; SENSORS;

SIGNAL RECONSTRUCTION;

EID: 65749101850     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2009.2016024     Document Type: Article

References (24)

1. W. Kautz and R. Singleton, "Nonrandom binary superimposed codes," IEEE Trans. Inf. Theory, vol. IT-10, no. 4, pp. 363-377, Oct. 1964.
2. E. Porat and A. Rothschild, "Explicit non-adaptive combinatorial group testing schemes," in Proc. Int. Colloquium on Automata, Languages and Programming (ICALP), Reykjavik, Iceland, Jul. 2008, vol. 1, pp. 748-759.
3. A. G. D'yachkov, A. J. Macula, D. C. Torney, P. A. Vilenkin, and S. M. Yekhanin, "New results in the theory of superimposed codes," in Proc. Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT) Bansko, Bulgaria, Jun. 2000, pp. 126-136.
4. A. D'yachkov, F. Hwang, A. Macula, P. Vilenkin, and C.-W.Weng, "A construction of pooling designs with some happy surprises," J. Comput. Biol., vol. 12, no. 8, pp. 1129-1136, Oct. 2005.
5. n," IEEE Trans. Inf. Theory, vol. 34, no. 4, pp. 877-880, Jul. 1988.
6. Z. Füredi and M. Ruszinkó, "An improved upper bound of the rate of Euclidean superimposed codes," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 799-802, Mar. 1999.
7. D. Donoho, "Compressed sensing," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 1289-1306, Feb. 2006.
8. E. Candès, J. Romberg, and T. Tao, "Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 489-509, Feb. 2006.
9. E. J. Candès, J. K. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Commun. Pure Appl. Math., vol. 59, no. 8, pp. 1207-1223, 2006.
10. E. J. Candès and T. Tao, "Near-optimal signal recovery from random projections: Universal encoding strategies?," IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5406-5425, Dec. 2006.
11. E. Candès and T. Tao, "Decoding by linear programming," IEEE Trans. Inf. Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005.
12. J. A. Tropp, "Greed is good: Algorithmic results for sparse approximation," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.
13. D. Needell and R. Vershynin, Uniform Uncertainty Principle and Signal Recovery via Regularized Orthogonal Matching Pursuit, 2007, Preprint.
14. W. Dai and O. Milenkovic, "Subspace pursuit for compressive sensing: Closing the gap between performance and complexity," IEEE Trans. Inf. Theory [Online]. Available: http://arxiv.org/abs/0803.0811v2, submitted for publication
15. D. Needell and J. A. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comp. Harmonic Anal., submitted for publication.
16. G. Cormode and S. Muthukrishnan, "What's hot and what's not: Tracking most frequent items dynamically," ACM Trans. Database Syst., vol. 30, no. 1, pp. 249-278, 2005.
17. W. Dai and O. Milenkovic, "Weighted Euclidean superimposed codes for integer compressed sensing," in Proc. IEEE Information Theory Workshop (ITW), Porto, Portugal, May 2008, pp. 124-128.
18. W. Dai and O. Milenkovic, "Constrained compressed sensing via superimposed coding," in Proc. Information Theory and Applications Workshop, San Diego, CA, Jan. 2008.
19. W. Dai and O. Milenkovic, "Sparse weighted Euclidean superimposed coding for integer compressed sensing," in Proc. Conference on Infomation Sciences and Systems (CISS), Princeton, NJ, Mar. 2008, pp. 470-475.
20. M. Sheikh, O. Milenkovic, and R. Baraniuk, "Designing compressive sensing DNA microarrays," in Proc. IEEE Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), St. Thomas, U.S. Virgin Islands, Dec. 2007, pp. 141-144.
21. W. Dai, M. Sheikh, O. Milenkovic, and R. Baraniuk, "Probe design for compressive sensing DNA microarrays," in Proc. IEEE Int. Conf. Bioinformatics and Biomedicine, Philadelphia, PA, Nov. 2008, pp. 163-169.
22. W. Feller, An Introduction to Probability Theory and Its Applications 2nd ed. New York: Wiley, 1971, vol. 2.
23. Chernoff Bound From Wikipedia, [Online]. Available: http:// en.wikipedia.org/wiki/Chernoff_bound
24. R. Vershynin, Non-Asymptotic Random Matrix Theory (Lecture Notes), 2007 [Online]. Available: http://www-personal.umich.edu/~romanv/teaching/ 2006-07/280/course.html