Deletion Correcting Using Generalized Reed-Solomon Codes
- 1 January 2004
- book chapter
- Published by Springer Nature
- p. 345-358
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Existence of Perfect 4-Deletion-Correcting Codes with Length SixDesigns, Codes and Cryptography, 2002
- A Combinatorial Construction for Perfect Deletion-Correcting CodesDesigns, Codes and Cryptography, 2001
- Reliable communication over channels with insertions, deletions, and substitutionsIEEE Transactions on Information Theory, 2001
- Improved decoding of Reed-Solomon and algebraic-geometry codesIEEE Transactions on Information Theory, 1999
- Existence of Perfect 3-Deletion-Correcting CodesDesigns, Codes and Cryptography, 1998
- On the construction of perfect deletion-correcting codes using design theoryDesigns, Codes and Cryptography, 1995
- Codes correcting a single insertion/deletion of a zero or a single peak-shiftIEEE Transactions on Information Theory, 1995
- Synchronization and substitution error-correcting codes for the Levenshtein metricIEEE Transactions on Information Theory, 1976
- Some general results of coding theory with applications to the study of codes for the correction of synchronization errorsInformation and Control, 1969