Classification of the deletion correcting capabilities of Reed-Solomon codes of dimension 2 over prime fields

IEEE Transactions on Information Theory

Volumn 53, Issue 6, 2007, Pages 2280-2294

  McAven, Luke ^a   Safavi Naini, Reihaneh ^b  

^a UNIVERSITY OF WOLLONGONG   (Australia)

^b UNIVERSITY OF CALGARY   (Canada)

Author keywords

Codes; Deletion correction; Reed Solomon

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); CODING ERRORS; DECODING; ERROR CORRECTION;

DELETION CORRECTION CODES; TRANSMISSION SYNCHRONIZATION;

REED-SOLOMON CODES;

EID: 34249815812     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2007.896889     Document Type: Article

References (17)

1. P. A. H. Bours, "On the construction of perfect deletion - Correcting codes using design theory," Designs, Codes, Cryptogr., vol. 6, pp. 5-20, 1995.
2. L. Calabi and W. E. Hartnett, "Some general results of coding theory with application to the study of codes for the correction of synchronisation errors," Inf. Contr., vol. 15, pp. 235-249, 1969.
3. V. Guruswami and M. Sudan, "Improved decoding of Reed - Solomon and algebraic - Geometry codes," IEEE Trans. Inf. Theory, vol. 45, pp. 1757-1767, 1999.
4. A. Klein, "On perfect deletion-correcting codes," J. Comb. Des., vol. 12, no. 1, pp. 72-77, 2004.
5. T. Kløve, "Codes correcting a single insertion/deletion of a zero or a single peak-shift," IEEE Trans. Inf. Theory, vol. 41, pp. 279-283, 1995.
6. V. I. Levenshtein, "Binary codes capable of correcting deletions, insertions and reversals," Soviet Phys. - Doklady, vol. 10, no. 8, pp. 707-710, 1966.
7. V. I. Levenshtein, "One method of constructing quasilinear codes providing synchronisation in the presence of errors," Probl. Inf. Transm., vol. 7, no. 3, pp. 215-222, 1971.
8. A. Mahmoodi, "Existence of perfect 3 - Deletion-correcting codes," Designs, Codes, Cryptogr., vol. 14, pp. 81-87, 1998.
9. R. Mathon and T. van Trung, "Directed t - Packings and directed t - Steiner systems," Designs, Codes, Cryptogr., vol. 18, pp. 187-198, 1999.
10. I. Reed and G. Solomon, "Polynomial codes over certain finite fields," SIAM J. Appl. Math., vol. 8, no. 2, pp. 300-304, 1960.
11. R. Safavi-Naini and Y. Wang, "Traitor tracing for shortened and corrupted fingerprints," in Proc. ACM-DRM'02, LNCS, 2003, vol. 2696, pp. 81-100.
12. N. Shalaby, J. Wang, and J. Yin, "Existence of perfect 4 - Deletion-Correcting codes with length six," Designs, Codes, Cryptogr., vol. 27, pp. 145-156, 2002.
13. N. J. A. Sloane, On Single-Deletion - Correcting Codes' in Codes and Designs. Columbus, OH: Math. Res. Inst. Publication, Ohio Univ., 2002, vol. 10, pp. 273-291.
14. E. Tanaka and T. Kasai, "Synchronisation and substitution error correcting codes for the Levenshtein metric," IEEE Trans. Inf. Theory, vol. 22, pp. 156-162, 1976.
15. R. R. Varshamov and G. M. Tenengolts, "Codes which correct single asymmetric errors (in Russian)," (in Russian) Avtomatika i Telemekhanika, vol. 26, no. 2, pp. 288-292, 1965.
16. Y. Wang, L. McAven, and R. Safavi-Naini, Deletion Correcting Using Generalised Reed-Solomon Codes.' t Coding, Cryptography and Combinatorics, K. Q. Feng, H. Niederreiter, and C. Xing, Eds. Basel: Birkhäuser, 2004.
17. J. Yin, "A combinatorial construction for perfect deletion-correcting codes," Designs, Codes and Cryptogr., vol. 23, pp. 99-110, 2001.