Construction of deletion correcting codes using generalized Reed–Solomon codes and their subcodes
A code is n-deletion correcting if it is possible to correct any n deletion of symbols having occurred in transmission of codewords. In this paper, we present explicit constructions of n-deletion correcting codes for arbitrary values of n using generalized Reed–Solomon codes and their subcodes.
KeywordsDeletion correcting Generalized Reed–Solomon codes
AMS Classifications11T71 94B50 12Y05
Unable to display preview. Download preview PDF.
- 7.Levenshtein VI (1971) One method of constructing quasilinear codes providing synchronisation in the presence of errors. Prob Inf Trans 7(3):215–222Google Scholar
- 9.Safavi-Naini R, Wang Y (2003) Traitor tracing for shortened and corrupted fingerprints. ACM-DRM’02 LNCS 2696:81–100Google Scholar