Some combinatorial constructions for optimal perfect deletion-correcting codes

Designs, Codes, and Cryptography

Volumn 48, Issue 3, 2008, Pages 331-347

  Wang, Jianmin ^a  

^a SOOCHOW UNIVERSITY   (China)

Author keywords

Code; Deletion correcting; Design; Optimal; Perfect

Indexed keywords

CODES (SYMBOLS); TURBULENT FLOW;

CARDINALITY; CODE-WORDS; CORRECTING CODES; POSITIVE INTEGERS;

CODES (STANDARDS);

EID: 47749132293     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-008-9212-8     Document Type: Article

References (26)

1. Assaf A.M., Mahmoodi A., Shalaby N., Yin J.: Directed packings with block size 5 and odd v. Aust. J. Combin. 13, 217-226 (1996)
2. Assaf A.M., Shalaby N., Yin J.: Directed packing and covering designs with block size four. Discrete Math. 238, 3-17 (2001)
3. Bennett F.E., Shalaby N., Yin J.: Existence of directed GDDs with block size five. J. Comb. Des. 6, 389-402 (1998)
4. Bennett F.E., Wei R., Yin J., Mahmoodi A.: Existence of DBIBDs with block size six. Utilitas Math. 43, 205-217 (1993)
5. Billington E.J., Stanton R.G., Stinson D.R.: On λ-packings with block size four (ν ≢ 0 mod 3). Ars Combin. 17A, 73-84 (1984)
6. Bours P.A.H.: On the construction of perfect deletion-correcting codes using design theory. Des. Codes Cryptogr. 6, 5-20 (1995)
7. n. J. Combin. Theory A 26, 278-297 (1979)
8. Brouwer A.E., Schrijver A., Hanani H.: Group divisible designs with block size four. Discrete Math. 20, 1-10 (1977)
9. Colbourn C.J., Colbourn M.J.: Every twofold triple system triple system can be directed. J. Combin. Theory A 34, 375-378 (1983)
10. Hall M. Jr.: Combinatorial Theory, 2nd edn. Wiley (1986).
11. Hanani H.: Balance incomplete block designs and related designs. Discrete Math. 11, 255-369 (1975)
12. Klein A.: On perfect deletion-correcting codes. J. Comb. Des. 12, 72-77 (2004)
13. Levenshtein V.I.: On perfect codes in deletion and insertion metric. Discrete Math. Appl. 2, 241-258 (1992)
14. Mahmoodi A.: Existence of perfect 3-deletion-correcting codes. Des. Codes Cryptogr. 14, 81-87 (1998)
15. Mullin R.C., Schellenberg P.J., Vanstone S.A., Wallis W.D.: On the existence of frames. Discrete Math. 37, 79-104 (1981)
16. Mullin R.C., Yin J.: On packings of pairs by quintuples: ν ≡ 3, 9 or 17 (mod 20). Ars Combin. 35, 161-171 (1993)
17. Sarvate D.G.: Some results on directed and cyclic designs. Ars Combin. 19A, 179-190 (1985)
18. Shalaby N., Wang J., Yin J.: Existence of perfect 4-deletion-correcting codes with length six. Des. Codes Cryptogr. 27, 145-156 (2002)
19. Shalaby N., Yin J.: Directed packings with block size 5 and even v. Des. Codes Cryptogr. 6, 133-142 (1995)
20. Street D.J., Seberry J.R.: All DBIBDs with block size four exist. Utilitas Math. 18, 27-34 (1980)
21. Street D.J., Wilson W.H.: On directed balanced incomplete block designs with block size five. Utilitas Math. 18, 161-174 (1980)
22. Wang J., Ji L.: Existence of T*(3, 4, v)-codes. J. Comb. Des. 13, 42-53 (2005)
23. Wang J., Yin J.: Constructions for perfect 5-deletion-correcting codes of length 7. IEEE Trans. Inform. Theory 52, 3676-3685 (2006)
24. Yin J.: On the packing of pairs by quintuples with index 2. Ars Combin. 31, 287-301 (1991)
25. Yin J.: A combinatorial construction for perfect deletion-correcting codes. Des. Codes Cryptogr. 23, 99-110 (2001)
26. Yin J., Assaf A.M.: Constructions of optimal packing designs. J. Comb. Des. 6, 245-260 (1998)