On perfect deletion-correcting codes

Journal of Combinatorial Designs

Volumn 12, Issue 1, 2004, Pages 72-77

  Klein, Andreas ^a  

^a UNIVERSITY OF KASSEL   (Germany)

Author keywords

Application of combinatorial designs (MSC: 94B60, 94B25, 94C30); Deletion correcting codes

Indexed keywords

EID: 0345742417     PISSN: 10638539     EISSN: 15206610     Source Type: Journal    
DOI: 10.1002/jcd.10069     Document Type: Article

References (9)

1. P. A. H. Bours, On the construction of perfect deletion-correcting codes using design theory, Designs, Codes and Cryptography 6 (1995), 5-20.
2. H. Hanani, On quadruple systems, Can J Math 12 (1960), 145-157.
3. D. L. Kreher, t-designs, t ≥ 3, Handbook of combinatorial designs, vol. 4, Discrete Mathematics and Its Applications, Chapter 1.3, J. H. Dinitz and C. J. Colbourn (editors). CRC Press, 1996, London, pp. 47-66.
4. V. I. Levenstein, On perfect codes in deletion/insertion metric, Discrete Math Appl 2(3) (1992), 241-258.
5. Translation from Discretnaya Mathematika 3(2) (1992), 3-20.
6. R. Mathon and T. van Trung, Directed t-packings and directed t-Steiner systems, Designs, Codes and Cryptography 18 (1999), 187-198.
7. N. Shalaby, J. Wang, and J. Yin, Existence of perfect 4-deletion-correcting codes with length six, Desings, Codes and Cryptography 23 (2001), 99-110.
8. E. Witt, Ü ber Steinersche Systeme, Abh Math Sem Hammburg 12 (1938), 265-275.
9. J. Yin, A combinatorial construction for perfect deletion-correcting codes, Desings, Codes and Cryptography 27 (2002), 145-156.