On Helberg's generalization of the levenshtein code for multiple deletion/insertion error correction

IEEE Transactions on Information Theory

Volumn 58, Issue 3, 2012, Pages 1804-1808

  Abdel Ghaffar, Khaled A S ^a   Palunčić, Filip ^b   Ferreira, Hendrik C ^b   Clarke, Willem A ^b  

^a University of California Davis   (United States)

^b UNIVERSITY OF JOHANNESBURG   (South Africa)

Author keywords

Helberg code; Levenshtein code; multiple deletion insertion error correction; synchronization error

Indexed keywords

EXHAUSTIVE TESTING; HELBERG CODE; LEVENSHTEIN CODE; SHORT CODES; SYNCHRONIZATION ERROR;

ERROR CORRECTION;

CODES (SYMBOLS);

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

References (17)

1. V. I. Levenshtein, "Binary codes capable of correcting deletions, insertions, and reversals," Sov. Phys.-Dokl., vol. 10, no. 8, pp. 707-710, Feb. 1966.
2. R. R. Varshamov and G. M. Tenengol'ts, "Codes which correct single asymmetric errors," Autom. Remote Control, vol. 26, no. 2, pp. 286-290, 1965.
3. N. J. A. Sloane, "On single-deletion-correcting codes," in Codes and Designs, K. T. Arasu and A. Seress, Eds. Berlin: Walter de Gruyter, 2002, pp. 273-291.
4. A. S. J. Helberg, "Coding for the correction of synchronization errors," Ph.D. dissertation, Rand Afrikaans Univ., Johannesburg, South Africa, 1993.
5. A. S. J. Helberg and H. C. Ferreira, "On multiple insertion/deletion correcting codes," IEEE Trans. Inf. Theory, vol. 48, no. 1, pp. 305-308, Jan. 2002.
6. T. G. Swart and H. C. Ferreira, "A note on double insertion/deletion correcting codes," IEEE Trans. Inf. Theory, vol. 49, no. 1, pp. 269-273, Jan. 2003.
7. L. Dolecek, "Rethinking the minimum distance: channels with varying sampling rate and iterative decoding of LDPC codes," Ph.D. dissertation, Univ. California, Berkeley, CA, 2007.
8. L. Dolecek and V. Anantharam, "On subsets of binary strings immune to multiple repetition errors," in Proc. 2007 IEEE Int. Symp. Inf. Theory, Nice, France, Jun. 24-29, 2007, pp. 1691-1695.
9. I. Landjev and K. Haralambiev, "On multiple deletion codes," Serdica J. Comput., vol. 1, no. 1, pp. 13-26, 2007.
10. H. Mercier, V. K. Bhargava, and V. Tarokh, "A survey of error-correcting codes for channels with symbol synchronization errors," IEEE Commun. Surv. Tutorials, vol. 12, no. 1, pp. 87-96, First Quarter 2010.
11. F.Wang, D. Fertonanis, and T. Duman, "Symbol-level synchronization and LDPC code design for insertion/deletion channels," IEEE Trans. Commun., vol. 59, no. 5, pp. 1287-1297, May 2011.
12. F. Palun̂cić, K. A. S. Abdel-Ghaffar, H. C. Ferreira, and W. A. Clarke, "A multiple insertion/deletion correcting code for run-length limited sequences," IEEE Trans. Inf. Theory., vol. 58, no. 3, pp. 0000-0000, Mar. 2012
13. Y. M. Chee, G. Ge, and A. C. H. Ling, "Spectrum of sizes for perfect deletion-correcting codes," SIAM J. Discrete Math., vol. 24, no. 1, pp. 33-55, 2010.
14. L. J. Schulman and D. Zuckerman, "Asymptotically good codes correcting insertions, deletions, and transpositions," IEEE Trans. Inf. Theory, vol. 45, no. 7, pp. 2552-2557, Nov. 1999.
15. M. C. Davey and D. J. C. MacKay, "Reliable communication over channels with insertions, deletions and substitutions," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 687-698, Feb. 2001.
16. K. A. S. Abdel-Ghaffar and H. C. Ferreira, "Systematic encoding of the Varshamov-Tenengol'ts codes and the Constantin-Rao codes," IEEE Trans. Inf. Theory, vol. 44, no. 1, pp. 340-345, Jan. 1998.
17. P. A. H. Bours, "Codes for correcting insertion and deletion errors," Ph.D. dissertation, Technische Universiteit Eindhoven, Eindhoven, The Netherlands, 1994.