Decoding concatenated codes using soft information

We present a decoding algorithm for concatenated codes when the outer code is a Reed-Solomon code and the inner code is arbitrary. "Soft" information on the reliability of various symbols is passed by the inner decodings and exploited in the Reed-Solomon decoding. This is the first analysis of such a soft algorithm that works for arbitrary inner codes; prior analyses could only, handle some special inner codes. Crucial to our analysis is a combinatorial result on the coset weight distribution of codes given only its minimum distance. Our result enables us to decode essentially up to the "Johnson radius" of a concatenated code when the outer distance is large (the Johnson radius is the "a priori list decoding radius" of a code as a function of its distance). As a consequence, we are able to present simple and efficient constructions of q-ary linear codes that are list decodable up to a fraction (1 - 1/q - /spl epsiv/) of errors and have rate /spl Omega/(/spl epsiv//sup 6/). Codes that can correct such a large fraction of errors have found numerous complexity-theoretic applications. The previous constructions of linear codes with a similar rate used algebraic-geometric codes and thus suffered from a complicated construction and slow decoding.

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

[2]  Venkatesan Guruswami,et al.  List decoding of error correcting codes , 2001 .

[3]  Amnon Ta-Shma,et al.  Extractor codes , 2001, IEEE Transactions on Information Theory.

[4]  E. J. Weldon.  Justesen's construction-The low-rate case (Corresp.) , 1973, IEEE Trans. Inf. Theory.

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

[6]  J. H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[7]  J. H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[8]  Luca Trevisan,et al.  Pseudorandom generators without the XOR Lemma , 1999, Electron. Colloquium Comput. Complex..

[9]  Ralf Koetter,et al.  Decoding of Reed-Solomon codes for additive cost functions , 2002, Proceedings IEEE International Symposium on Information Theory,.

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

[11]  Elchanan Mossel,et al.  On the complexity of approximating the VC dimension , 2002, J. Comput. Syst. Sci..

[12]  Christopher Umans,et al.  Pseudo-random generators for all hardnesses , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[13]  M. Sudan,et al.  On Representations of Algebraic-Geometric Codes , 1998 .

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

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

[16]  Madhu Sudan.  List decoding: algorithms and applications , 2000, SIGA.

[17]  Christopher Umans,et al.  Simple extractors for all min-entropies and a new pseudo-random generator , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

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

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

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

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

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