Decoding interleaved Reed-Solomon codes over noisy channels

Theoretical Computer Science

Volumn 379, Issue 3, 2007, Pages 348-360

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

^a LUCENT TECHNOLOGIES   (United States)

^b University of Connecticut   (United States)

^c RSA   (United States)

^d Columbia University ^*  (United States)

Author keywords

Efficient decoding; Polynomial reconstruction; Probabilistic algorithms; Reed Solomon codes

Indexed keywords

CHANNEL CODING; DECODING; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

BINARY SYMMETRIC CHANNEL (BSC); DECODING ALGORITHM; EFFICIENT DECODING; POLYNOMIAL RECONSTRUCTION; PROBABILISTIC ALGORITHMS;

REED-SOLOMON CODES;

EID: 34248585738     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.02.043     Document Type: Article

References (15)

1. Berlekamp E.R. Bounded distance+1 soft-decision Reed-Solomon decoding. IEEE Trans. Inform. Theory IT-42 (1996) 704-720
2. Elwyn R. Berlekamp, L. Welch, Error correction of algebraic block codes, US Patent, Number 4, 633, 470, 1986
3. Daniel Bleichenbacher, Aggelos Kiayias, Moti Yung, Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Proceedings, in: Lecture Notes in Computer Science, vol. 2719, Springer, pp. 97-108
4. Don Coppersmith, Madhu Sudan, Reconstructing curves in three (and higher) dimensional space from noisy data, in: Proceedings of the 35th ACM Symposium on Theory of Computing, STOC, San Diego, California, 9-11 June, 2003, pp. 136-142
5. Forney G.D. Concatenated Codes (1966), MIT Press, Cambridge, MA
6. Guruswami V., and Sudan M. Improved decoding of Reed-Solomon and algebraic-geometric codes. Proceedings of the 39th Annual Symposium on Foundations of Computer Science (1998), IEEE Computer Society 28-39
7. Kiayias A., and Yung M. Secure games with polynomial expressions. Proceedings of the 28th International Colloquium in Algorithms, Languages and Programming. ICALP. LNCS vol. 2076 (2001) 939-950
8. Hugo Krawczyk, Distributed fingerprints and secure information dispersal, PODC 1992, pp. 207-218
9. MacWilliams F.J., and Sloane N. The Theory of Error Correcting Codes (1977), North Holland, Amsterdam
10. Menezes A.J., van Oorschot P.C., and Vanstone S.A. Handbook of Applied Cryptography (1996), CRC Press
11. Parvaresh F., and Vardy A. Correcting errors beyond the Guruswami-Sudan radius in polynomial time. 46th Annual IEEE Symposium on Foundations of Computer Science. FOCS 2005 (2005), IEEE Computer Society 285-294
12. Rabin M.O. Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM 38 (1989) 335-348
13. Schwartz J.T. Fast Probabilistic algorithms for verifications of polynomial identities. J. ACM 27 4 (1980) 701-717
14. Sudan M. Decoding of Reed-Solomon codes beyond the error-correction bound. J. Complexity 13 1 (1997) 180-193
15. Vanstone S.A., and Van Oorshot P.C. An Introduction to Error Correcting Codes with Applications (1989), Kluwer Academic Publishers