Asymptotically good codes correcting insertions, deletions, and transpositions
- 1 January 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 45 (7) , 2552-2557
- https://doi.org/10.1109/18.796406
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Bounded distance+1 soft-decision Reed-Solomon decodingIEEE Transactions on Information Theory, 1996
- Linear-time encodable and decodable error-correcting codesPublished by Association for Computing Machinery (ACM) ,1995
- Codes correcting a single insertion/deletion of a zero or a single peak-shiftIEEE Transactions on Information Theory, 1995
- Construction of fixed-length insertion/deletion correcting runlength-limited codesIEEE Transactions on Information Theory, 1994
- Lee-metric BCH codes and their application to constrained and partial-response channelsIEEE Transactions on Information Theory, 1994
- On perfect codes in deletion and insertion metricDiscrete Mathematics and Applications, 1992
- An Overview of Sequence Comparison: Time Warps, String Edits, and MacromoleculesSIAM Review, 1983
- Synchronization and substitution error-correcting codes for the Levenshtein metricIEEE Transactions on Information Theory, 1976
- A Method for the Correction of Garbled Words Based on the Levenshtein MetricIEEE Transactions on Computers, 1976
- A family of codes for the correction of substitution and synchronization errorsIEEE Transactions on Information Theory, 1969