Maximum distance holey packings and related codes. (English) Zbl 0944.05018
Summary: The notion of a maximum distance holey packing is introduced and used to construct optimal ternary \((n,3,3)\) codes for all lengths \(n\equiv 2\pmod 3\) and \(n\geq 8\). Combining this with T. Etzion’s result in [Discrete Math. 169, No. 1-3, 55-82 (1997)], the existence problem for an optimal ternary \((n,3,3)\) code is solved completely.
References:
| [1] | Etzion, T., Optimal constant weight codes overZ_k and generalized designs, Discrete Math., 169, 55-55 (1997) · Zbl 0974.05016 · doi:10.1016/0012-365X(95)00333-R |
| [2] | Phelps, K.; Yin, C., Generalized Steiner systems with block three and group sizeg = 3 (mod 6), J. Combin. Designs, 5, 417-417 (1997) · Zbl 0913.05024 · doi:10.1002/(SICI)1520-6610(1997)5:6<417::AID-JCD3>3.0.CO;2-I |
| [3] | Hanani, H., Balanced incomplete block designs and related designs, Discrete Math., 11, 255-255 (1975) · Zbl 0361.62067 · doi:10.1016/0012-365X(75)90040-0 |
| [4] | Schoenheim, J., On maximal system of k-tuples, Studia Sci. Math. Hungar., 1, 363-363 (1966) · Zbl 0146.01403 |
| [5] | Yin, Jianxing; Assaf, A. M., Constructions of optimal packing designs, J. Combin. Designs, 6, 245-245 (1998) · Zbl 0911.05026 · doi:10.1002/(SICI)1520-6610(1998)6:4<245::AID-JCD3>3.0.CO;2-F |
| [6] | Yin, Jianxing, Some combinatorial constructions for optical orthogonal codes, Discrete Math., 185, 201-201 (1998) · Zbl 0949.94010 · doi:10.1016/S0012-365X(97)00172-6 |
| [7] | Brouwer, A. E.; Schrijver, A.; Hanani, H., Group divisible designs with block size 4, Discrete Math., 20, 1-1 (1977) · Zbl 0371.62105 · doi:10.1016/0012-365X(77)90037-1 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
