On the Weight Enumerators of the Projections of the 2-adic Golay Code of Length 24 to Z2e
نویسنده
چکیده
In [2], Calderbank and Sloane investigated codes over the p-adics and examined lifts of codes over Zp to Zpe and to the p-adics. They described the [8, 4, 5] 2-adic Hamming code, the [24, 12, 13] 2-adic Golay code, and the [12, 6, 7] 3-adic Golay code. These three codes are all self-dual and MDS. In [3], Dougherty, Kim, and Park gave the weight distribution of the projections of these three codes to Zpe . For the 2-adic Hamming code and the 3-adic Golay code, they completed the weight distribution. But they did not complete the case of 2-adic Golay code. In this paper, we complete the weight distribution of the projections of the 2-adic Golay code to Zpe for all e ≥ 1. In specific, let Ge be the projections of the 2-adic Golay code to Zpe for some e ≥ 1. Then the weight enumerator of Ge is given by (1) WGe(x, y) = 12 ∑ j=0 ci ( x + (2 − 1)y )j (xy − y2)24−2j . There are 13 unknowns c0, c1, c2, . . . , c12 in (1). Let (A e 0, A e 1, . . . , A e 24) be the weight distribution of Ge. From [2], we know the minimum distance of Ge is eight for all e ≥ 1, and from [3] we know A8 = 759 and A9 = 0 for all e ≥ 1. So that if we know A10, A e 11, and A e 12, then we can determine WGe(x, y). From [3], we also know that A10, A e 11, A e 12 remain constant for e ≥ 7. In summary, we only have to calculate A10, A e 11, and A e 12 for e = 3, 4, 5, 6, 7 to complete the weight distribution of Ge for all e ≥ 1. The object of this paper is to compute these values. All the computation of this paper was made using Magma [1] with a 2.3GHz and 3.0GB RAM PC. We will also discuss the algorithmic aspect of the program written in MAGMA. 2010 Mathematics Subject Classification. 94B05.
منابع مشابه
Modular and p-adic Cyclic Codes
This paper presents some basic theorems giving the structure of cyclic codes of length n over the ring of integers modulo pa and over the p-adic numbers, where p is a prime not dividing n. An especially interesting example is the 2-adic cyclic code of length 7 with generator polynomial X 3 + ,~X 2 + (L I)X -l, where )~ satisfies ~2 _ k + 2 = 0. This is the 2-adic generalization of both the bina...
متن کاملTricolore designs in Type III codes
A split complete weight enumerator in six variables is used to study the colored designs held by codewords of xed composition in Type III codes containing the all one codeword In particular the ternary Golay code contains colored designs We conjecture that every weight class in a Type III code with the all one codeword holds colored designs Introduction Colored designs were introduced in to stu...
متن کاملOn the Codes Related to the Higman-Sims Graph
All linear codes of length 100 over a field F which admit the Higman-Sims simple group HS in its rank 3 representation are determined. By group representation theory it is proved that they can all be understood as submodules of the permutation module FΩ where Ω denotes the vertex set of the Higman-Sims graph. This module is semisimple if charF 6= 2, 5 and absolutely indecomposable otherwise. Al...
متن کاملComputing Symmetrized Weight Enumerators for Lifted Quadratic Residue Codes
The paper describes a method to determine symmetrized weight enumerators of Zpm -linear codes based on the notion of a disjoint weight enumerator. Symmetrized weight enumerators are given for the lifted quadratic residue codes of length 24 modulo 2 and modulo 3 , for any positive m .
متن کاملm-Projections involving Minkowski inverse and range symmetric property in Minkowski space
In this paper we study the impact of Minkowski metric matrix on a projection in the Minkowski Space M along with their basic algebraic and geometric properties.The relation between the m-projections and the Minkowski inverse of a matrix A in the minkowski space M is derived. In the remaining portion commutativity of Minkowski inverse in Minkowski Space M is analyzed in terms of m-projections as...
متن کامل