On coset weight distributions of the Z/sub 4/-linear Goethals codes
Tor Helleseth, Victor A. Zinoviev · IEEE Transactions on Information Theory · 2001
We study the coset weight distributions of two well-known families of codes: the three-error-correcting binary Z/sub 4/-linear Goethals codes of length N=2/sup m+1/, m/spl ges/3 odd, and the Z/sub 4/-linear Goethals codes over Z/sub 4/ of length n=N/2=2/sup m/. The hard case is the weight distributions of cosets of weight 4. To know the weight distribution of the coset of weight 4 we have to know the number of codewords of weight 4 in such a coset. Altogether, there are nine different types of cosets of weight 4. For six cases, we give the exact expressions for the number of codewords of weight 4, and for three other cases, we give such expressions in terms of Kloosterman sums.