Abstract
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.
Similar content being viewed by others
References
Etzion, T., Optimal constant weight codes overZ k and generalized designs,Discrete Math., 1997, 169: 55.
Phelps, K., Yin, C., Generalized Steiner systems with block three and group sizeg = 3 (mod 6),J. Combin. Designs, 1997, 5: 417.
Hanani, H., Balanced incomplete block designs and related designs,Discrete Math., 1975, 11: 255.
Schoenheim, J., On maximal system of k-tuples,Studia Sci. Math. Hungar., 1966, 1: 363.
Yin Jianxing, Assaf, A. M., Constructions of optimal packing designs,J. Combin. Designs, 1998, 6: 245.
Yin Jianxing, Some combinatorial constructions for optical orthogonal codes,Discrete Math., 1998, 185: 201.
Brouwer, A. E., Schrijver, A., Hanani, H., Group divisible designs with block size 4,Discrete Math., 1977, 20: 1.
Author information
Authors and Affiliations
Additional information
Project supported by the National Natural Science Foundation of China (Grant No. 19671064).
Rights and permissions
About this article
Cite this article
Yin, J., Lu, Y. & Wang, J. Maximum distance holey packings and related codes. Sci. China Ser. A-Math. 42, 1262–1269 (1999). https://doi.org/10.1007/BF02876026
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02876026