Asymptotically good codes correcting insertions, deletions, and transpositions

IEEE Transactions on Information Theory

Volumn 45, Issue 7, 1999, Pages 2552-2557

  Schulman, Leonard J ^a   Zuckerman, David ^b,c  

^a Georgia Institute of Technology   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR CORRECTING CODES;

COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; ENCODING (SYMBOLS); ERROR ANALYSIS; ERROR CORRECTION; MATHEMATICAL MODELS; PROBABILITY; RANDOM PROCESSES;

CODES (SYMBOLS);

EID: 0033349233     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.796406     Document Type: Article

References (25)

1. A. Albanese, J. Blomer, J. Edmonds, M. Luby, and M. Sudan, "Priority encoding transmission," in 35th Annu. Symp. Foundations of Computer Science, 1994, pp. 604-612.
2. N. Alon, J. Edmonds, and M. Luby, "Linear time erasure codes with nearly optimal recovery," in 36th Annu. Symp. Foundations of Computer Science, 1995, pp. 512-519.
3. E. R. Berlekamp, "Bounded distance +1 soft-decision Reed-Solomon decoding," IEEE Trans. Inform. Theory, vol. 42, pp. 704-720, May 1996.
4. P. A. H. Bours, "Construction of fixed-length insertion/deletion correcting runlength-limited code," IEEE Trans. Inform. Theory, vol. 40, pp. 1841-1856, Nov. 1994.
5. L. Calabi and W. E. Hartnett, "A family of codes for the correction of substitution and synchronization errors," IEEE Trans. Inform. Theory, vol. IT-15, pp. 102-106, Jan. 1969.
6. R. L. Dobrushin, "Shannon's theorems for channels with synchronization errors," Probl. Inform. Transm., vol. 3, no. 4, pp. 11-26, 1967
7. (trans. from Probl. Pered. Inform., vol. 3, no. 4, pp. 18-36, 1967).
8. R. G. Gallager, "Sequential decoding for binary channels with noise and synchronization errors," Lincoln Lab. Group Rep. 2502, Sept. 1966; unclassified document AD266879, Armed Services Technical Information Agency, Arlington Hall Station, Arlington VA.
9. P. Gemmell and M. Sudan, "Highly resilient correctors for polynomials," Inform. Processing Lett., vol. 43, no. 4, pp. 169-174, 1992.
10. J. Justesen, "A class of constructive, asymptotically good algebraic codes," IEEE Trans. Inform. Theory, vol. IT-18, pp. 652-656, Sept. 1972.
11. J. B. Kruskal, "An overview of sequence comparison: Time warps, string edits, and macromolecules," SIAM Rev., vol. 25, no. 2, pp. 201-237, Apr. 1983.
12. T. Kløve, "Codes correcting a single insertion/deletion of a zero or a single peak-shift," IEEE Trans. Inform. Theory, vol. 41, pp. 279-283, Jan. 1995.
13. V. I. Levenshtein, "Binary codes capable of correcting deletions, insertions, and reversals," Sov. Phys.-Dokl., vol. 10, no. 8, pp. 707-710, Feb. 1966
14. (translated from Dokl. Akad. Nauk SSSR, vol. 163, no. 4, pp. 845-848, Aug. 1965).
15. _, "On perfect codes in deletion and insertion metric," Discr. Math. Appl., vol. 2, no. 3, pp. 241-258, 1992.
16. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
17. T. Okuda, E. Tanaka, and T. Kasai, "A method for the correction of garbled words based on the Levenshtein metric," IEEE Trans. Comput., vol. C-25, no. 2, pp. 172-178, Feb. 1976.
18. B. Reiffen, "Sequential encoding and decoding for the discrete memoryless channel," Res. Lab. Electron., MIT, Tech. Rep., vol. 374, 1960.
19. R. M. Roth and P. H. Siegel, "Lee-metric BCH codes and their application to constrained and partial-response channels," IEEE Trans. Inform. Theory, vol. 40, pp. 1083-1096, July 1994.
20. D. Spielman, "Linear-time encodable and decodable error-correcting codes," in 27th Anna. ACM Symp. Theory of Computing, 1995, pp. 388-397.
21. E. Tanaka and T. Kasai, "Synchronization and substitution error-correcting codes for the Levenshtein metric," IEEE Trans. Inform. Theory, vol. IT-22, pp. 156-162, Mar. 1976.
22. G. Tenengolts, "Nonbinary codes, correcting single deletion or insertion," IEEE Trans. Inform. Theory, vol. IT-30, pp. 766-769, Sept. 1984.
23. J. D. Ullman, "On the capabilities of codes to correct synchronization errors," IEEE Trans. Inform. Theory, vol. IT-13, pp. 95-105, Jan. 1967.
24. L. Welch and E. R. Berlekamp, "Error Correction of Algebraic Block Codes," U.S. Patent 4633470, Dec. 1986.
25. J. M. Wozencraft, "Sequential decoding for reliable communications," Res. Lab. Electron., MIT, Tech. Rep., vol. 325, 1957.