1 research outputs found
The completion of optimal -packings
A 3- packing design consists of an -element set and a
collection of -element subsets of , called {\it blocks}, such that every
-element subset of is contained in at most one block. The packing number
of quadruples denotes the number of blocks in a maximum
- packing design, which is also the maximum number of
codewords in a code of length , constant weight , and minimum Hamming
distance 4. In this paper the undecided 21 packing numbers are shown
to be equal to Johnson bound
where ,
is odd,