No label defined (Q4773715)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3450216
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3450216 |
Statements
1971
0 references
self-dual codes
0 references
weight of code vector
0 references
weight distribution of code
0 references
MacWilliams equations
0 references
weight enumerators
0 references
Gleason polynomials
0 references
Hamming code
0 references
Golay code
0 references
invariant ring
0 references
free polynomial ring
0 references
Let \(V\) be the \(n\)-dimensional space of all \(n\)-tuples over \(\mathrm{GF}(q)\) where any two vectors are added by component-wise addition in \(\mathrm{GF}(q)\). An \((n,k)\) code over \(\mathrm{GF}(q)\) is a \(k\)-dimensional subspace of \(V\). If \(A\) is an \((n,k)\) code, then the orthogonal of \(A\), denoted by \(A^\perp\) is the \((n,n-k)\) code consisting of all vectors in \(V\) which are orthogonal to all of \(A\) under the usual dot product. When \(A= A^\perp\), \(A\) is called self-dual. The weight of a code vector is the number of non-zero components it has. The weight distribution of a code is the number of vectors in it of any given weight. The MacWilliams equations [see \textit{F. J. MacWilliams}, ``A theorem on the distribution of weights in a systematic code,'' Bell Syst. Techn. J. 42, 79--84 (1963)] and the power moments [see \textit{V. Pless}, ``Power moment identities or weight distributions in error correcting codes'', Inf. Control 6, 147--152 (1963; Zbl 0149.37905)] relate the weight distribution of \(A\) to the weight distribution of \(A\). When \(A\) is self-dual, this places considerable restraints on the weight distribution of \(A\). A very interesting advance in weight enumerators occurred when the author proved that the weight distribution of any self-dual code over \(\mathrm{GF}(2)\) or \(\mathrm{GF}(3)\) is given as a sum of products of certain polynomials commonly referred to as the Gleason polynomials. We regard a polynomial in \(x\) and \(y\) as representing a weight distribution of an \((n,n/2)\) self-dual code \(C\) by taking the coefficient of \(x^{n-i}y^i\) to be the number of vectors of weight \(i\) in the code. It is known that all weights of a self-dual code over \(\mathrm{GF}(2)\) must be even. There are three sets of Gleason polynomials as follows. 1) Over GF(2) the weight distribution of any self-dual code is a sum of products of powers of \(x^2 + y^2\) and \(x^8 +14x^4y^4 +y^8\). -- The former is the weight distribution of the unique \((2,1)\) self-dual code, and the latter is the weight distribution of the Hamming \((8,4)\) code. 2) Over \(\mathrm{GF}(2)\) the weight distribution of any doubly even codes is a sum of products of powers of \(x^8 +14x^4y^4 +y^8\) and \(x^{24} +759x^{18}y^8 +2576x^{12}y^{12} +759x^8y^{18} + y^{24}\). The latter is the weight distribution of the \((24, 12)\) Golay code. 3) Over \(\mathrm{GF}(3)\) the weight distribution of any self-dual code is a sum of products of powers of \(y^4 + 8x^3y\) and \(y^3 (x^3 - y^3)^3\). These polynomials have been used widely for many theoretical coding problems. In addition to their theoretical interest, the Gleason polynomials are very useful in the actual computation of weight distributions. - These results are demonstrated by showing that for each situation above, the weight polynomials form a free ring which is invariant under a certain group. In case 1, this group is \(D_8\) with 16 elements, in case 3 the group has 48 elements. In each case this invariant ring is a free polynomial ring generated by its Gleason polynomials. [This article was published in the book announced in Zbl 0219.00001.]
0 references