Synchronization and Substitution Error-Correcting Codes for the Levenshtein Metric

IEEE Transactions on Information Theory

Volumn 22, Issue 2, 1976, Pages 156-162

  Tanaka, Eiichi ^a   Kasal, Tamotsu ^a  

^a Osaka Prefecture University   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CODES;

CODES, SYMBOLIC;

EID: 0016925961     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1976.1055532     Document Type: Article

References (18)

1. W. W. Peterson and E. J. Weldon, Error-Correcting Codes. Cambridge, Mass.: M.I.T., 1972
2. J. J. Stiffier, Theory of Synchronous Communication. Englewood Cliffs, N.J.: Prentice-Hall, 1971.
3. S. W. Golomb, B. Gordon, and L. R. Welch, “Comma-free, codes,” Canadian J. Math., vol. 10, pp. 202–209, 1958.
4. E. N. Gilbert, “Synchronization of binary messages,” IRE Trans. Inform. Theory, vol. IT-6, pp. 470–477, Sept. 1960.
5. C. Y. Lee, “Some properties of non-binary error-correcting codes,” IRE Trans. Inform. Theory, vol. IT-4, pp. 77–82, June 1958.
6. F. F. Sellers, “Bit loss and gain correction codes,” IRE Trans. Inform. Theory, vol, IT-8, pp. 35–38, Jan. 1962.
7. J. D. Ullman, “Near-optimal, single-synchronization-error-correcting code,” IEEE Trans. Inform. Theory, vol. IT-12, pp. 418–424, Oct. 1966.
8. V. I. Levenshtein, “Binary codes with correction of deletions, insertions and substitution of symbols,” Dokl. Akad. Nank. SSSR, vol. 163, pp. 845–848, 1965.
9. V. I. Levenshtein, “Binary codes capable of correcting spurious insertions and deletions of ones,” Probl. Peredachi Inform., vol. 1, pp. 12–25. 1965. ‘
10. V. I. Levenshtein, “Binary codes capable of correcting deletions, insertions and reversals,” Sov. Phys. Doklady, vol. 10, p. 707, 1966.
11. J. D. Ullman, “On the capabilities of codes to correct synchronization errors,” IEEE Trans. Inform. Theory, vol. IT-13, pp. 95–105, Jan. 1967.
12. L. Calabi and W. E. Hartnett, “A family of codes for the correction. of substitution and syncronization errors,” IEEE Trans. Inform. Theory, vol. IT-15, pp, 102–106, Jan. 1969.
13. T. Hatcher, “The number of sequences in An c for 0 ≤ C ≤ 13, 0≤ n ≤ 13, and listings of selected A codes,” Parke Mathematical Lab., Carlisle, Mass., 0030-TM-13, 1968.
14. T. Okuda, E. Tanaka, and T. Kasai, “The extension of a distance concept and its applications,” rep. of professional research groups on pattern recognition and learning, Institute of Electronics and Communication of Japan (in Japanese), PRL 72–128, Jan. 1973.
15. R. E. Bellman and S. E. Dreyfus, Applied Dynamic Programming. Princeton, N.J.: Princeton Univ., 1962.
16. D. Sankoff, “Matching sequences under deletion/insertion constraints,” in Proc. Nat. A cad. Sci. U.S.A., vol. 69, pp. 4–6, Jan. 1972.
17. E. Tanaka and T. Kasai, “Families of codes based on Levenshtein distance,” rep. of professional research groups on pattern recognition and learning, Institute of Electronics and Communications of Japan (in Japanese), PRL 73–76. Jan. 1974.
18. T. Okuda, E. Tanaka, and T. Kasal, “A method of correcting garbled words based on Levenshtein metric,” IEEE Trans. Comput. (to be published).