A note on double insertion/deletion correcting codes

IEEE Transactions on Information Theory

Volumn 49, Issue 1, 2003, Pages 269-273

  Swart, Theo G ^a   Ferreira, Hendrik C ^a  

^a UNIVERSITY OF JOHANNESBURG   (South Africa)

Author keywords

Block codes; Error correction coding; Forward error correction; Synchronization

Indexed keywords

ERROR CORRECTION; SIGNAL ENCODING; SYNCHRONIZATION;

ERROR CORRECTION CODING;

BLOCK CODES;

EID: 0037271458     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.806155     Document Type: Article

References (15)

1. V. I. Levenshtein, "Binary codes capable of correcting deletions, insertions and reversals" (in Russian), Dokl. Akad. Nauk SSSR, vol. 162, no. 4, pp. 845-848, 1965. English translation in Sov.-Phys.-Dokl., vol. 10, no. 8, pp. 707-710, Feb. 1966.
2. V. I. Levenshtein, "Binary codes capable of correcting deletions, insertions and reversals" (in Russian), Dokl. Akad. Nauk SSSR, vol. 162, no. 4, pp. 845-848, 1965. English translation in Sov.-Phys.-Dokl., vol. 10, no. 8, pp. 707-710, Feb. 1966.
3. J. D. Ullman, "On the capabilities of codes to correct synchronization errors," IEEE Trans. Inform. Theory, vol. IT-13, no. 1, pp. 95-105, Jan. 1967.
4. A. S. J. Helberg, W. A. Clarke, H. C. Ferreira, and A. J. H. Vinck, "A class of DC free, synchronization error correcting codes," IEEE Trans. Magn., vol. 29, no. 6, pp. 4048-4049, Nov. 1993.
5. H. C. Ferreira, W. A. Clarke, A. S. J. Helberg, K. A. S. Abdel-Ghaffar, and A. J. H. Vinck, "Insertion/deletion correction with spectral nulls," IEEE Trans. Inform. Theory, vol. 43, pp. 722-732, Mar. 1997.
6. A. S. J. Helberg and H. C. Ferreira, "On multiple insertion/deletion correcting codes," IEEE Trans. Inform. Theory, vol. 48, pp. 305-308, Jan. 2002.
7. 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.
8. P. A. H. Bours, "Construction of fixed-length insertion/deletion correcting run-length-limited codes," IEEE Trans. Inform. Theory, vol. 40, pp. 1841-1856, Nov. 1994.
9. M. Blaum, J. Bruck, C. M. Melas, and H. C. A. van Tilborg, "Methods for synchronizing (d, k)-constrained sequences," in Proc. 1994 IEEE Int. Conf Communications, New Orleans, LA, 1994, pp. 1800-1808.
10. N. J. A. Sloane. (200) On single-deletion-correcting codes. Ray-Chaudhuri Festschrift [Online]. Available: http://www.research.att.com/̃njas/
11. M. C. Davey and D. J. C. MacKay, "Reliable communication over channels with insertions, deletions and substitutions," IEEE Trans. Inform. Theory, vol. 47, pp. 687-698, Feb. 2001.
12. L. J. Schulman and D. Zuckerman, "Asymptotically good codes correcting insertions, deletions and transpositions," IEEE Trans. Inform. Theory, vol. 45, pp. 2552-2557, Nov. 1999.
13. D. S. Hirschberg, "Bounds on the number of string subsequences," in Proc. 10th Symp. Combinatorial Pattern Matching (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, July 1999, vol. 1645, pp. 115-122.
14. V. I. Levenshtein, "Efficient reconstruction of sequences from their sub-sequences or supersequences," J. Comb. Theory, ser. A, vol. 93, no. 2, pp. 310-332, 2001.
15. 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, pp. 172-178, Feb. 1976.