Efficiently decodable compressed sensing by list-recoverable codes and recursion

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 14, Issue , 2012, Pages 230-241

  Ngo, Hung Q ^a   Porat, Ely ^b   Rudra, Atri ^a  

^a State University of New York   (United States)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

Compressed Sensing; List Recoverable Codes; Sub Linear Time Decoding

Indexed keywords

COMPOSITION METHOD; INTEGER PARAMETERS; LIST-RECOVERABLE CODES; MEASUREMENT MATRIX; NEAR-OPTIMAL; NON NEGATIVES; RECOVERABILITY; RECURSIVE TECHNIQUES;

COMPRESSED SENSING; COMPUTER SCIENCE; DECODING; MATRIX ALGEBRA; OPTIMIZATION;

SIGNAL RECONSTRUCTION;

EID: 84879815290     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2012.230     Document Type: Conference Paper

References (19)

1. Rudolf Ahlswede and Vladimir B. Balakirsky. Construction of uniquely decodable codes for the two-user binary adder channel. IEEE Trans. Inform. Theory, 45(1): 326-330, 1999.
2. Daniel Augot and Lancelot Pecquet. A hensel lifting to replace factorization in list-decoding of algebraic-geometric and reed-solomon codes. IEEE Transactions on Information Theory, 46(7): 2605-2614, 2000.
3. Khanh Do Ba, Piotr Indyk, Eric Price, and David P. Woodruff. Lower bounds for sparse recovery. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1190-1197, 2010.
4. Emmanuel J. Candès, Justin K. Romberg, and Terence Tao. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Transactions on Information Theory, 52(2): 489-509, 2006.
5. Mahdi Cheraghchi. Noise-resilient group testing: Limitations and constructions. In Proceedings of the 17th International Symposium on Fundamentals of Computation Theory (FCT'2009), pages 62-73, 2009.
6. Graham Cormode and S. Muthukrishnan. Combinatorial algorithms for compressed sensing. In 13th International Colloquium on Structural Information and Communication Complexity (SIROCCO), pages 280-294, 2006.
7. David L. Donoho. Compressed sensing. IEEE Transactions on Information Theory, 52(4): 1289-1306, 2006.
8. Anna C. Gilbert and Piotr Indyk. Sparse recovery using sparse matrices. Proceedings of the IEEE, 98(6): 937-947, 2010.
9. Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp, and Roman Vershynin. One sketch for all: fast algorithms for compressed sensing. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), pages 237-246, 2007.
10. Venkatesan Guruswami. List decoding of error-correcting codes. Number 3282 in Lecture Notes in Computer Science. Springer, 2004.
11. Venkatesan Guruswami and Atri Rudra. Soft decoding, dual BCH codes, and better list-decodable e-biased codes. In Proceedings of the 23rd Annual IEEE Conference on Computational Complexity (CCC), pages 163-174, 2008.
12. Venkatesan Guruswami, Christopher Umans, and Salil P. Vadhan. Unbalanced expanders and randomness extractors from parvaresh-vardy codes. In Proceedings of the 22nd Annual IEEE Conference on Computational Complexity, pages 96-108, 2007.
13. Piotr Indyk, Hung Q. Ngo, and Atri Rudra. Efficiently decodable non-adaptive group testing. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1126-1142, 2010.
14. Piotr Indyk and Milan Ruzic. Near-optimal sparse recovery in the l1 norm. In Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 199-207, 2008.
15. W. H. Kautz and R. C. Singleton. Nonrandom binary superimposed codes. IEEE Trans. Inf. Theory, 10: 363-377, 1964.
16. S. Muthukrishnan. Data Streams: Algorithms and Applications, volume 1. NOW, 2005.
17. Hung Q. Ngo, Ely Porat, and Atri Rudra. Efficiently decodable error-correcting list disjunct matrices and applications. In ICALP (1), pages 557-568, 2011.
18. Farzad Parvaresh and Alexander Vardy. Correcting errors beyond the Guruswami-Sudan radius in polynomial time. In Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 285-294, 2005.
19. Ely Porat and Martin Strauss. Sublinear time, measurement-optimal, sparse recovery for all, July 2012. To be presented at SODA 2012. Also arXiv: 1012.1886 [cs.DS].