Abstract
Deletion correction codes have numerous applications including transmission synchronisation and more recently, tracing traitors. We consider the deletion correcting property of generalized Reed-Solomon codes and describe a class of generalized Reed-Solomon codes which correct one deletion. We also identify other codes that can correct numerous deletion errors including one that can correct the deletion of over half of the components of a codeword.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P.A.H. Bours, ‘On the construction of perfect deletion-correcting codes using design theory’ Designs Codes and Cryptography 6 (1995) 5–20.
L. Calabi and W.E. Hartnett, ‘Some general results of coding theory with applications to the study of codes for the correction of synchronisation errors’ Information and Control 15 (1969) 235–249.
M.C. Davey and D.J.C. MacKay, ‘Reliable communication over channels with insertions, deletions and substitutions’ IEEE Transactions on Information Theory 47(2) (2001) 687–696.
V. Guruswami and M. Sudan, ‘Improved decoding of Reed-Solomon and algebraic-geometry codes’ IEEE Transactions on Information Theory 45(6) (1999) 1757–1767.
T. K1Øve, ‘Codes correcting a single insertion/deletion of a zero or a single peak-shift’ IEEE Transactions on Information Theory 41 (1995) 279–283.
V.I. Levenshtein, ‘Binary codes capable of correcting deletions, insertions and reversals’ Soviet Physics - Doklady 10(8) (1966) 707–710.
V.I. Levenshtein, ‘One method of constructing quasilinear codes providing synchronisation in the presence of errors.’ Problems of Information Transmission 7(3) (1971) 215–222.
A. Mahmoodi, ‘Existence of perfect 3-deletion-correcting codes’ Designs Codes and Cryptography 14 (1998) 81–87.
R. Safavi-Naini and Y. Wang, ‘Traitor tracing for shortened and corrupted fingerprints’ ACM-DRM’02 LNCS 2696 (2003) 81–100.
N. Shalaby, J. Wang and J. Yin, ‘Existence of perfect 4-deletion-correcting codes with length six’ Designs Codes and Cryptography 27 (2002) 145–156.
N.J.A. Sloane, ‘On single-deletion-correcting codes’ Codes and Designs. Mathematical Research Institute Publications 10 (Ohio University, 2002) 273–292.
E. Tanaka and T. Kasai, ‘Synchronisation and substitution error-correcting codes for the Levenshtein metric’ IEEE Transactions on Information Theory 22 (1976) 156–162.
J. Yin, ‘A combinatorial construction for perfect deletion-correcting codes’ Designs Codes and Cryptography 23 (2001) 99–110.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer Basel AG
About this paper
Cite this paper
Wang, Y., McAven, L., Safavi-Naini, R. (2004). Deletion Correcting Using Generalized Reed-Solomon Codes. In: Feng, K., Niederreiter, H., Xing, C. (eds) Coding, Cryptography and Combinatorics. Progress in Computer Science and Applied Logic, vol 23. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-7865-4_24
Download citation
DOI: https://doi.org/10.1007/978-3-0348-7865-4_24
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-0348-9602-3
Online ISBN: 978-3-0348-7865-4
eBook Packages: Springer Book Archive