Abstract
Recently, active research has been performed on constructing t-designs from linear codes over Z 4. In this paper, we will construct a new simple 3 − (2m, 7, 14/3 (2m − 8)) design from codewords of Hamming weight 7 in the Z 4-Goethals code for odd m ≥ 5. For 3 arbitrary positions, we will count the number of codewords of Hamming weight 7 whose support includes those 3 positions. This counting can be simplified by using the double-transitivity of the Goethals code and divided into small cases. It turns out interestingly that, in almost all cases, this count is related to the value of a Kloosterman sum. As a result, we can also prove a new Kloosterman sum identity while deriving the 3-design.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. F. Assmus, Jr. and H. F. Mattson, Jr., New 5-designs, J. Combin. Theory, Vol. 6 (1969) pp. 122–151.
A. Bonnecaze, E. Rains and P. Solé, 3-Colored 5-designs and Z4-codes. Research Report No. 4, Royal Melbourne Institute of Technology, Australia (1998).
C. J. Colbourn and J. H. Dinitz, The CRC Handbook of Combinatorial Designs, CRC Press (1996).
I. Duursma, T. Helleseth, C. Rong and K. Yang, Split weight enumerators for the Preparata codes with applications to designs, Designs, Codes and Cryptography, Vol. 18 (1999) pp. 103–124.
A. R. Hammons, P. V. Kumar, A. R. Calderbank, N. J. A. Sloane and P. Solé, The Z4-linearity of Kerdock, Preparata, Goethals, and related codes, IEEE Trans. on Inform. Theory, Vol. 40, No. 2 (1994) pp. 301–319.
M. Harada, New 5-designs constructed from the lifted Golay code over Z4, preprint, presented at the Recent Results Session of 1997 IEEE International Symposium on Information Theory, Ulm, Germany, June 29- July 4 (1997).
M. Harada, New 5-designs constructed from the lifted Golay code over Z4, J. of Combin. Designs, Vol. 6 (1998) pp. 225–229.
T. Helleseth and P. V. Kumar, The algebraic decoding of the Z4-linear Goethals code, IEEE Trans. on Inform. Theory, Vol. 41, No. 6 (1995) pp. 2040–2048.
T. Helleseth, P.V. Kumar and K. Yang, An infinite family of 3-designs from Preparata codes over Z4, Designs, Codes and Cryptography, Vol. 15 (1998) pp. 175–181.
T. Helleseth, C. Rong and K. Yang, New 3-designs from Goethals codes over Z4, Discrete Mathematics, Vol. 226 (2001) pp. 403–409.
T. Helleseth and V. Zinoviev, On Z4-linear Goethals codes and Kloosterman sums, Designs, Codes and Cryptography, Vol. 17 (1999) pp. 269–288.
D. Shin, P. V. Kumar and T. Helleseth, An Assmus-Mattson-Type approach for identifying 3-designs from linear codes over Z4, submitted to Designs, Codes and Cryptography.
K. Yang and T. Helleseth, On the weight hierarchy of Goethals codes over Z4, IEEE Trans. on Inform. Theory, Vol. 44 (1998) pp. 304–307.
L. A. Bassalygo, G. V. Zaitsev and V. A. Zinoviev, Uniformly packed codes, Problems of Info. Trans., Vol. 10 (1974) pp. 6–9.
N. V. Semakov, V. A. Zinoviev and G. V. Zaitsev, Uniformly packed codes, Problems of Info. Trans., Vol. 7 (1971) pp. 30–39.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Shin, DJ., Kumar, P.V. & Helleseth, T. 3-Designs from the Z 4-Goethals Codes via a New Kloosterman Sum Identity. Designs, Codes and Cryptography 28, 247–263 (2003). https://doi.org/10.1023/A:1024153804090
Issue Date:
DOI: https://doi.org/10.1023/A:1024153804090