Construction of deletion correcting codes using generalized Reed-Solomon codes and their subcodes

Designs, Codes, and Cryptography

Volumn 42, Issue 2, 2007, Pages 227-237

  Tonien, Dongvu ^a   Safavi Naini, Reihaneh ^a  

^a UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

Deletion correcting; Generalized Reed Solomon codes

Indexed keywords

CRYPTOGRAPHY; DIPLEX TRANSMISSION; ERROR CORRECTION; INFORMATION DISSEMINATION;

DELETION CORRECTING CODES; REED-SOLOMON CODES;

CODES (SYMBOLS);

EID: 33846209192     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-006-9032-7     Document Type: Article

References (14)

1. Bours PAH (1995) On the construction of perfect deletion-correcting codes using design theory. Design Code Cryptogr 6:5-20
2. Calabi L, Hartnett WE (1969) Some general results of coding theory with applications to the study of codes for the correction of synchronisation errors. Inf Control 15:235-249
3. Davey MC, MacKay DJC (2001) Reliable communication over channels with insertions, deletions and substitutions. IEEE Trans Inf Theory 47(2):687-696
4. Guruswami V, Sudan M (1999) Improved decoding of Reed-Solomon and algebraic geometry codes. IEEE 'Irans Inf Theory 45(6): 1757-1767
5. Klove T (1995) Codes correcting a single insertion/deletion of a zero or a single peakshift. IEEE Trans Inf Theory 41:279-283
6. Levenshtein VI (1966) Binary codes capable of correcting deletions, insertions and reversals. Sov Phys-Dokl 10(8):707-710
7. Levenshtein VI (1971) One method of constructing quasilinear codes providing synchronisation in the presence of errors. Prob Inf Trans 7(3):215-222
8. Mahmoodi A (1998) Existence of perfect 3-deletion-correcting codes. Design Code Cryptogr 14:81-87
9. Safavi-Naini R, Wang Y (2003) Traitor tracing for shortened and corrupted fingerprints. ACM-DRM'02 LNCS 2696:81-100
10. Shalaby N, Wang J, Yin J (2002) Existence of perfect 4-deletion- correcting codes with length six. Design Code Cryptogr 27:145-156
11. Sloane NJA (2002) On single-deletion-correcting codes. Code Designs Math Res Inst Publ 10:273-292
12. Tanaka E, Kasai T (1976) Synchronization and substitution error-correcting codes for the Levenshtein metric. IEEE Trans Inf Theory 22:156-162
13. Wang Y, McAven L, Safavi-Naini R (2004) Deletion correcting using generalized Reed-Solomon codes. Prog Comput Sci Appl Logic 23:345-358
14. Yin J (2001) A combinatorial construction for perfect deletion-correcting Codes. Design Code Cryptogr 23:99-110