Decoding of interleaved Reed Solomon codes over noisy data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 97-108

  Bleichenbacher, Daniel ^a   Kiayias, Aggelos ^b   Yung, Moti ^c  

^a LUCENT TECHNOLOGIES   (United States)

^b University of Connecticut   (United States)

^c Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINS; BLOCK CODES; CHANNEL CAPACITY; CODES (SYMBOLS); ERROR CORRECTION; REED-SOLOMON CODES;

BINARY SYMMETRIC CHANNEL; DECODING ALGORITHM; MULTI DIMENSIONAL; NOISY DATA; NON-BINARY; POLYNOMIAL RECONSTRUCTION; PROBABILISTIC ALGORITHM; PROBABILISTIC EXTENSION;

DECODING;

EID: 21144446985     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_9     Document Type: Article

References (13)

1. Elwyn R. Berlekamp, Bounded distance+1 soft-decision Reed-Solomon decoding, IEEE Trans. Info. Theory, vol. IT-42, pp. 704-720, May 1996.
2. Elwyn R. Berlekamp and L. Welch, Error Correction of Algebraic Block Codes. U.S. Patent, Number 4,633,470, 1986.
3. Don Coppersmith and Madhu Sudan, Reconstructing Curves in Three (and higher) Dimensional Space from Noisy Data, to appear in the proceedings of the 35th ACM Symposium on Theory of Computing (STOC), June 9-11, 2003, San Diego, California.
4. G. David Forney, Concatenated Codes, MIT Press, Cambridge, MA, 1966
5. Venkatesan Guruswami and Madhu Sudan, Improved Decoding of Reed-Solomon and Algebraic-Geometric Codes. In the Proceedings of the 39th Annual Symposium on Foundations of Computer Science, IEEE Computer Society, pp. 28-39, 1998.
6. Aggelos Kiayias and Moti Yung, Secure Games with Polynomial Expressions, In the Proceedings of the 28th International Colloquium in Algorithms, Languages and Programming (ICALP), 2001, LNCS Vol. 2076, pp. 939-950.
7. Hugo Krawczyk, Distributed Fingerprints and Secure Information Dispersal, PODC 1992, pp. 207-218.
8. F. J. MacWilliams and N. Sloane, The Theory of Error Correcting Codes. North Holland, Amsterdam, 1977.
9. Alfred J. Menezes, Paul C. van Oorschot and Scott A. Vanstone, Handbook of Applied Cryptography, CRC Press, 1996.
10. Michael O. Rabin, Efficient dispersal of information for security, load balancing, and fault tolerance, J. ACM 38, pp. 335-348, 1989.
11. J. T. Schwartz, Fast Probabilistic Algorithms for Verifications of Polynomial Identities, Journal of the ACM, Vol. 27(4), pp. 701-717, 1980.
12. Madhu Sudan, Decoding of Reed Solomon Codes beyond the Error-Correction Bound. Journal of Complexity 13(1), pp. 180-193, 1997.
13. S. A. Vanstone and P. C. VanOorshot, An Introduction to Error Correcting Codes with Applications, Kluwer Academic Publishers, 1989.