Infinite Families of 3-Designs from Z4 -Goethals Codes with Block Size 8
Author:
- Kalle RantoKRKalle Ranto
- 1 January 2002
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 15 (3) , 289-304
Abstract
We construct several new families of simple 3-designs from codewords of the $\mathbf Z_4$-Goethals codes. These designs have parameters 3-$(2^m,8,\lambda)$ with odd $m\ge 5$. The smallest design has $\lambda=14(2^m-8)/3$, and the others are corollaries of this and some previously known designs. In the existence proofs we analyze the low-weight codewords and count the number of solutions to certain systems of equations over finite fields.
Keywords
This publication has 16 references indexed in Scilit:
- 3-Colored 5-Designs and Z4-CodesJournal of Statistical Planning and Inference, 2000
- Split Weight Enumerators for the Preparata Codes with Applications to DesignsDesigns, Codes and Cryptography, 1999
- New infinite families of 3-designs from preparata codes over Z4Discrete Mathematics, 1999
- Extremal double circulant Type II codes over Z4 and construction of 5-(24, 10, 36) designsDiscrete Mathematics, 1999
- An Infinite Family of 3-Designs from Preparata Codes overZ4Designs, Codes and Cryptography, 1998
- New 5-designs constructed from the lifted Golay code over ?4Journal of Combinatorial Designs, 1998
- The algebraic decoding of the Z/sub 4/-linear Goethals codeIEEE Transactions on Information Theory, 1995
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codesIEEE Transactions on Information Theory, 1994
- New 5-designsJournal of Combinatorial Theory, 1969
- On the solution of algebraic equations over finite fieldsInformation and Control, 1967