Decoding Reed - Solomon codes beyond half the minimum distance using shift-register synthesis

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 459-463

  Schmidt, Georg ^a   Sidorenko, Vladimir ^a   Bossert, Martin ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COLLABORATIVE DECODING STRATEGIES; SHIFT-REGISTER SYNTHESIS;

ALGEBRA; ALGORITHMS; COMPUTER SUPPORTED COOPERATIVE WORK;

CODES (SYMBOLS);

EID: 39049123289     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261711     Document Type: Conference Paper

References (14)

1. R. E. Blahut, "Transform techniques for error control codes," IBM J. Research and Development, vol. 23, pp. 299-315, May 1979.
2. M. Sudan, "Decoding of Reed-Solomon codes beyond the error correction bound," J. Complexity, vol. 13, pp. 180-193, March 1997.
3. V. Guruswami and M. Sudan, "Improved decoding of Reed-Solomon and algebraic-geometric codes," IEEE Trans. Inform. Theory, vol. IT-45, pp. 1755-1764, September 1999.
4. G. Schmidt and V. R. Sidorenko, "Linear shift-register synthesis for multiple sequences of varying length." Preprint, available at ArXiv, arXiv:cs.IT/0605044, 2006.
5. G. Schmidt and V. R. Sidorenko, "Multi-sequence linear shift-register synthesis: The varying length case," in Proc. IEEE Intern. Symposium on Inf. Theory, (Seattle, USA), 2006.
6. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
7. J. L. Massey, "Shift-register synthesis and BCH decoding," IEEE Trans. Inform. Theory, vol. 15, pp. 122-127, January 1969.
8. D. Bleichenbacher, A. Kiayias, and M. Young, "Decoding of interleaved Reed Solomon codes over noisy data," in Springer Lecture Notes in Computer Science, vol. 2719, pp. 97-108, January 2003.
9. G. Schmidt, V. R. Sidorenko, and M. Bossert, "Error and erasure correction of interleaved Reed-Solomon codes." to appear in Springer Lecture Notes in Computer Science, vol. 3969, 2006.
10. G. Schmidt, V. R. Sidorenko, and M. Bossert, "Interleaved Reed-Solomon codes in concatenated code designs," in Proc. IEEE ITSOC Inform. Theory Workshop, (Rotorua, New Zealand), 2005.
11. G. Schmidt, V. R. Sidorenko, and M. Bossert, "Collaborative decoding of interleaved Reed-Solomon codes and concatenated code designs." Preprint, 2006.
12. G.-L. Feng and K. K. Tzeng, "A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes," IEEE Trans. Inform. Theory, vol. 37, pp. 1274-1287, September 1991.
13. R. Roth and G. Ruckenstein, "Efficient decoding of Reed-Solomon codes beyond half the minimum distance," IEEE Trans. Inform. Theory, vol. 46, January 2000.
14. D. Coppersmith and M. Sudan, "Reconstructing curves in three (and higher) dimensional space from noisy data," in Proc. ACM Symposium on Theory of Computing, (San Diego, USA), pp. 136-142, June 2003.