ISSN:
1573-7586
Keywords:
code
;
deletion-correcting
;
perfect
;
directed design
;
BGDD
;
DBIBD
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract Bours [4] recently showed some constructions for perfect 2 and 3-deletion-correcting codes from combinatorial designs. He settled existence of perfect 2-deletion-correcting codes with words of length 4. However, the existence of perfect 3-deletion-correcting codes with words of length 5, or T*(2, 5, v), remained unsettled for v ≡ 7, 8 (mod 10) and v = 13, 14, 15, 16. In this paper we provide new constructions for these codes from combinatorial designs, and show that a T*(2, 5, v) exists for all v.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1023/A:1008212622423
Permalink