Design theory
On the construction of perfect deletion-correcting codes using design theory
Designs, Codes and Cryptography
Optimal constant weight codes over Zk and generalized designs
Discrete Mathematics
Some combinational constructions for optical orthogonal codes
Discrete Mathematics
Existence of Perfect 3-Deletion-CorrectingCodes
Designs, Codes and Cryptography
Generalized Steiner Systems {\rm GS}(2, 4, v, 2) with v a Prime Power \equiv 7 ({\it mod}\ {12})
Designs, Codes and Cryptography
The spectrum for large set of disjoint incomplete Latin squares
Discrete Mathematics
Constant Weight Codes and Group Divisible Designs
Designs, Codes and Cryptography
A Combinatorial Construction for PerfectDeletion-Correcting Codes
Designs, Codes and Cryptography
| Hi-index | 0.04 |
Maximum distance holey packings (MDHPs) of type gn with block size k, MDHP(2,k,n,g)'s, are equivalent to optimal (g + 1)-ary (n,k,2(k - 2) + 1) codes. This paper surveys some recent developments concerning MDHPs including new results and various construction techniques. A number of further questions are also discussed.