论文信息 - Maximum distance holey packings and related codes

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 lengthsn=2 (mod 3) andn≥8. Combining this with Etzion’s result, the existence problem for an optimal ternary (n,3,3) code is solved completely.

[1] Haim Hanani,et al. Balanced incomplete block designs and related designs , 1975, Discret. Math..

[2] Tuvi Etzion,et al. Optimal constant weight codes over Zk and generalized designs , 1997, Discret. Math..

[3] Kevin T. Phelps,et al. Generalized Steiner systems with block size three and group sizeg ? 3(mod 6) , 1997 .

[4] Ahmed M. Assaf,et al. Constructions of optimal packing designs , 1998 .

[5] Jianxing Yin,et al. Some combinatorial constructions for optical orthogonal codes , 1998, Discret. Math..