Resolvable group divisible designs with block size 3
Discrete Mathematics - Combinatorial designs: a tribute to Haim Hanani
A new class of group divisible designs with block size three
Journal of Combinatorial Theory Series A
Some recent developments on BIBDs and related designs
Discrete Mathematics - Special issue on discrete mathematics in China
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
Directed packing and covering designs with block size four
Discrete Mathematics
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
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
Genomic distances under deletions and insertions
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Asymptotically good codes correcting insertions, deletions, and transpositions
IEEE Transactions on Information Theory
Reliable communication over channels with insertions, deletions, and substitutions
IEEE Transactions on Information Theory
A note on double insertion/deletion correcting codes
IEEE Transactions on Information Theory
Constructions for Perfect 5-Deletion-Correcting Codes of Length
IEEE Transactions on Information Theory
Using Reed–Muller RM (1, m) Codes Over Channels With Synchronization and Substitution Errors
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
One peculiarity with deletion-correcting codes is that perfect $t$-deletion-correcting codes of the same length over the same alphabet can have different numbers of codewords, because the balls of radius $t$ with respect to the Levenshte&brevei;n distance may be of different sizes. There is interest, therefore, in determining all possible sizes of a perfect $t$-deletion-correcting code, given the length $n$ and the alphabet size $q$. In this paper, we determine completely the spectrum of possible sizes for perfect $q$-ary 1-deletion-correcting codes of length three for all $q$, and perfect $q$-ary 2-deletion-correcting codes of length four for almost all $q$, leaving only a small finite number of cases in doubt.