Simple Codes and Sparse Recovery with Fast Decoding

Construction of error-correcting codes achieving a designated minimum distance parameter is a central problem in coding theory. A classical and algebraic family of error-correcting codes studied for this purpose are the BCH codes. In this work, we study a very simple construction of linear codes that achieve a given distance parameter K. Moreover, we design a simple, nearly optimal syndrome decoder for the code as well. The running time of the decoder is only logarithmic in the block length of the code, and nearly linear in the distance parameter K. This decoder can be applied to exact for-all sparse recovery over any field, improving upon previous results with the same number of measurements. Furthermore, computation of the syndrome from a received word can be done in nearly linear time in the block length. We also demonstrate an application of these techniques in non-adaptive group testing, and construct simple explicit measurement schemes with O(K2 log2 N) tests and O(K3 log2 N) recovery time for identifying up to K defectives in a population of size N.

[1]  Mahdi Cheraghchi,et al.  Noise-resilient group testing: Limitations and constructions , 2008, Discret. Appl. Math..

[2]  Amnon Ta-Shma,et al.  Lossless Condensers, Unbalanced Expanders, And Extractors , 2007, Comb..

[3]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[4]  Atri Rudra,et al.  Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications - (Extended Abstract) , 2011, ICALP.

[5]  A. Robert Calderbank,et al.  Efficient and Robust Compressed Sensing Using Optimized Expander Graphs , 2009, IEEE Transactions on Information Theory.

[6]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .

[7]  Daniel A. Spielman,et al.  Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[8]  Rafail Ostrovsky,et al.  Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data , 2004, SIAM J. Comput..

[9]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[10]  Joel A. Tropp,et al.  Algorithmic linear dimension reduction in the l_1 norm for sparse vectors , 2006, ArXiv.

[11]  Kannan Ramchandran,et al.  SAFFRON: A fast, efficient, and robust framework for group testing based on sparse-graph codes , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[12]  Graham Cormode,et al.  Combinatorial Algorithms for Compressed Sensing , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[13]  Atri Rudra,et al.  Efficiently decodable non-adaptive group testing , 2010, SODA '10.

[14]  Ely Porat,et al.  For-All Sparse Recovery in Near-Optimal Time , 2014, ACM Trans. Algorithms.

[15]  Piotr Indyk,et al.  Nearly Optimal Deterministic Algorithm for Sparse Walsh-Hadamard Transform , 2015, SODA.

[16]  Avi Wigderson,et al.  Randomness conductors and constant-degree lossless expanders , 2002, STOC '02.

[17]  R. Vershynin,et al.  One sketch for all: fast algorithms for compressed sensing , 2007, STOC '07.

[18]  Ely Porat,et al.  Search Methodologies , 2022 .

[19]  Venkatesan Guruswami,et al.  Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes , 2009, JACM.

[20]  Piotr Indyk,et al.  Combining geometry and combinatorics: A unified approach to sparse signal recovery , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.