Maximum distance holey packings and related codes

摘要

The notion of a maximum distance holey packing is introduced and used to construct optimal ternary (n, 3, 3) codes for all lengths n≡2 (mod 3) and n≥8. Combining this with Etzion’s result, the existence problem for an optimal ternary (n, 3,3)code is solved completely.