论文信息 - An Infinite Family of 3-Designs from Preparata Codes overZ4

An Infinite Family of 3-Designs from Preparata Codes overZ4

We show that the support of minimum Lee weight codewords having Hamming weight 5 in the Preparata code over Z4 form a 3-(2m,5,10) design for any odd integer m ≥ 3.

Tor Helleseth | P. Vijay Kumar | Kyeongcheol Yang

[1] Tor Helleseth,et al. On the weight hierarchy of Preparata codes over Z4 , 1997, IEEE Trans. Inf. Theory.

[2] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .

[3] A. Robert Calderbank,et al. An upper bound for Weft exponential sums over Galois tings and applications , 1994, IEEE Trans. Inf. Theory.

[4] M. Harada. New 5‐designs constructed from the lifted Golay code over ℤ4 , 1998 .

[5] Jürgen Bierbrauer,et al. A new family of 4-designs , 1995, Graphs Comb..

[6] N. J. A. Sloane,et al. The Z4-linearity of Kerdock, Preparata, Goethals, and related codes , 1994, IEEE Trans. Inf. Theory.

[7] Vladimir D. Tonchev,et al. A class of Steiner 4-wise balanced designs derived from preparata codes , 1996 .

[8] Tor Helleseth,et al. The algebraic decoding of the Z/sub 4/-linear Goethals code , 1995 .

[9] W. O. Alltop,et al. An infinite class of 4-designs , 1969 .

[10] W. J. Thron,et al. Encyclopedia of Mathematics and its Applications. , 1982 .

[11] H. Mattson,et al. New 5-designs , 1969 .

[12] A. Baartmans,et al. The preparata codes and a class of 4‐designs , 1994 .

[13] Tor Helleseth,et al. The algebraic decoding of the Z/sub 4/-linear Goethals code , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.