Synchronization and substitution error-correcting codes for the Levenshtein metric
- 1 March 1976
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 22 (2) , 156-162
- https://doi.org/10.1109/tit.1976.1055532
Abstract
Block codes are constructed that are capable of simultaneously correctingeor fewer synchronization errors intconsecutive words, for anyt geq 2e + 1, andsor fewer substitution errors in eachoft - 1or fewer of these words under the condition that there exists at least one ungarbled word among thetconsecutive words. Also, some new extensions of theA_{n}^{c}codes of Calabi and Hartnett are presented under the condition that synchronization and substitution errors do not coexist in thetconsecutive words.Keywords
This publication has 10 references indexed in Scilit:
- A Method for the Correction of Garbled Words Based on the Levenshtein MetricIEEE Transactions on Computers, 1976
- Matching Sequences under Deletion/Insertion ConstraintsProceedings of the National Academy of Sciences, 1972
- A family of codes for the correction of substitution and synchronization errorsIEEE Transactions on Information Theory, 1969
- On the capabilities of codes to correct synchronization errorsIEEE Transactions on Information Theory, 1967
- Near-optimal, single-synchronization-error-correcting codeIEEE Transactions on Information Theory, 1966
- Applied Dynamic ProgrammingPublished by Walter de Gruyter GmbH ,1962
- Bit loss and gain correction codeIEEE Transactions on Information Theory, 1962
- Synchronization of binary messagesIEEE Transactions on Information Theory, 1960
- Some properties of nonbinary error-correcting codesIEEE Transactions on Information Theory, 1958
- Comma-Free CodesCanadian Journal of Mathematics, 1958