Expander-based constructions of efficiently decodable codes

We present several novel constructions of codes which share the common thread of using expander (or expander-like) graphs as a component. The expanders enable the design of efficient decoding algorithms that correct a large number of errors through various forms of "voting" procedures. We consider both the notions of unique and list decoding, and in all cases obtain asymptotically good codes which are decodable up to a "maximum" possible radius and either: (a) achieve a similar rate as the previously best known codes but come with significantly faster algorithms, or (b) achieve a rate better than any prior construction with similar error-correction properties. Among our main results are: i) codes of rate /spl Omega/(/spl epsi//sup 2/) over constant-sized alphabet that can be list decoded in quadratic time from (1-/spl epsi/) errors; ii) codes of rate /spl Omega/(/spl epsi/) over constant-sized alphabet that can be uniquely decoded from (1/2-/spl epsi/) errors in near-linear time (this matches AG-codes with much faster algorithms); iii) linear-time encodable and decodable binary codes of positive rate (in fact, rate /spl Omega/(/spl epsi//sup 2/)) that can correct up to (1/4-/spl epsi/) fraction errors.

[1]  Amin Shokrollahi,et al.  List Decoding of Algebraic-Geometric Codes , 1999, IEEE Trans. Inf. Theory.

[2]  Peter Elias,et al.  List decoding for noisy channels , 1957 .

[3]  Madhu Sudan,et al.  Decoding of Reed Solomon Codes beyond the Error-Correction Bound , 1997, J. Complex..

[4]  R. Roth,et al.  Efficient decoding of Reed-Solomon codes beyond half the minimum distance , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[5]  Venkatesan Guruswami,et al.  List decoding algorithms for certain concatenated codes , 2000, STOC '00.

[6]  Daniel A. Spielman.  Linear-time encodable and decodable error-correcting codes , 1996, IEEE Trans. Inf. Theory.

[7]  Venkatesan Guruswami,et al.  On representations of algebraic-geometry codes , 2001, IEEE Trans. Inf. Theory.

[8]  H. Stichtenoth,et al.  A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound , 1995 .

[9]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometric codes , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[10]  Venkatesan Guruswami,et al.  Improved decoding of Reed-Solomon and algebraic-geometry codes , 1999, IEEE Trans. Inf. Theory.

[11]  M. Tsfasman,et al.  Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert bound , 1982 .

[12]  Alexander Barg,et al.  Linear-Time Decodable, Capacity Achieving Binary Codes With Exponentially Falling Error Probability , 2000 .

[13]  Venkatesan Guruswami,et al.  Combinatorial bounds for list decoding , 2002, IEEE Trans. Inf. Theory.

[14]  G. David Forney,et al.  Generalized minimum distance decoding , 1966, IEEE Trans. Inf. Theory.

[15]  A. Lubotzky,et al.  Ramanujan graphs , 2017, Comb..

[16]  Vladimir M. Blinovsky,et al.  List decoding , 1992, Discrete Mathematics.

[17]  D. Spielman,et al.  Expander codes , 1996 .

[18]  Gilles Zémor,et al.  On expander codes , 2001, IEEE Trans. Inf. Theory.

[19]  Noga Alon,et al.  Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.

[20]  Ba-Zhong Shen.  A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate , 1993, IEEE Trans. Inf. Theory.

[21]  Daniel Augot,et al.  A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes , 2000, IEEE Trans. Inf. Theory.

[22]  Kenneth W. Shum,et al.  A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound , 2001, IEEE Trans. Inf. Theory.