Design theory
On the construction of perfect deletion-correcting codes using design theory
Designs, Codes and Cryptography
Directed packings with block size 5 and even v
Designs, Codes and Cryptography
Directed packings and coverings with computer applications
Directed packings and coverings with computer applications
A Combinatorial Construction for PerfectDeletion-Correcting Codes
Designs, Codes and Cryptography
Existence of Perfect 4-Deletion-Correcting Codes with Length Six
Designs, Codes and Cryptography
A survey on maximum distance Holey packings
Discrete Applied Mathematics
Construction of deletion correcting codes using generalized Reed---Solomon codes and their subcodes
Designs, Codes and Cryptography
Some combinatorial constructions for optimal perfect deletion-correcting codes
Designs, Codes and Cryptography
Spectrum of Sizes for Perfect Deletion-Correcting Codes
SIAM Journal on Discrete Mathematics
| Hi-index | 0.00 |
Bours [4] recently showed some constructions for perfect 2 and3-deletion-correcting codes from combinatorial designs. He settled existenceof perfect 2-deletion-correcting codes with words of length 4. However, theexistence of perfect 3-deletion-correcting codes with words of length 5, orT^*(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 thesecodes from combinatorial designs, and show that a T^*(2, 5, v)exists for all v.