Design theory
On the construction of perfect deletion-correcting codes using design theory
Designs, Codes and Cryptography
Existence of Perfect 3-Deletion-CorrectingCodes
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
Collusion Secure q-ary Fingerprinting for Perceptual Content
DRM '01 Revised Papers from the ACM CCS-8 Workshop on Security and Privacy in Digital Rights Management
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 |
By a T^\ast(2, k, v)-code we mean a perfect(k-2)-deletion-correcting code of length k over an alphabet ofsize v, which is capable of correcting any combination of up to(k-2) deletions and insertions of letters occured in transmission ofcodewords. In this paper, we provide a combinatorial construction forT^\ast(2, k, v)-codes. As an application, we show that aT^\ast(2, 6, v)-code exists for all positive integersv\not\equiv 3 (mod 5), with at most 12 possible exceptions of v. In theprocedure, a result on incomplete directed BIBDs is also established which is ofinterest in its own right.