Corpus ID: 51620993

A note on regular subgroups of the automorphism group of the linear Hadamard code

  title={A note on regular subgroups of the automorphism group of the linear Hadamard code},
We consider the regular subgroups of the automorphism group of the linear Hadamard code. These subgroups correspond to the regular subgroups of GA(r, 2), w.t.r action on the vectors of F r 2 , where n = 2r−1 is the length of the Hamadard code. We show that the dihedral group D2r−1 is a regular subgroup of GA(r, 2) only when r = 3. Following the approach of [13] we study the regular subgroups of the Hamming code obtained from the regular subgroups of the automorphism group of the Hadamard code… Expand


Let V be a vector space over a field F of characteristic p > 0 and let T be a regular subgroup of the affine group AGL(V ). In the finite dimensional case we show that, if T is abelian or p > 0, thenExpand
Coding Theory and the Mathieu Groups
A new proof is presented of the fact that G acts on the eight points as the alternating group, A 8 , and on the 15 points on the general linear group, G ℳ(4, 2) is presented. Expand
Abelian regular subgroups of the affine group and radical rings
We establish a link between abelian regular subgroup of the affine group, and commutative, associative algebra structures on the underlying vector space that are (Jacobson) radical rings. As anExpand
On extending propelinear structures of the Nordstrom–Robinson code to the Hamming code
  • I. Mogilnykh
  • Mathematics, Computer Science
  • Probl. Inf. Transm.
  • 2016
A record-breaking number of propelinear structures are obtained in the class of extended perfect codes of length 16, based on the description of partitions of the Hamming code of length 15 into Nordstrom–Robinson codes via Fano planes. Expand
On binary 1-perfect additive codes: Some structural properties
A characterization of propelinear codes as codes having a regular subgroup of the full group of isometrics of the code is established and a characterization of the automorphism group of a 1-perfect additive code is given. Expand
A characterization of 1-perfect additive codes
A full characterization of perfect single error-correcting codes, or 1 perfect codes, that are subgroups of F/sup n/ with a distance-compatible Abelian structure is given and it is proved that two such codes are different if they have different parameters. Expand
On Z2k-Dual Binary Codes
  • D. Krotov
  • Computer Science, Mathematics
  • IEEE Trans. Inf. Theory
  • 2007
The new generalization Phi:Z2 kn rarr Z2 2k-1n is connected with the known generalized Gray map phi in the following way: if the authors take two dual linear Z2 k-codes and construct binary codes from them using the generalizations phi and Phi of the Gray map, then the weight enumerators of the binary codes obtained will satisfy the MacWilliams identity. Expand
Z4-linear Hadamard and extended perfect codes
  • D. Krotov
  • Computer Science, Mathematics
  • Electron. Notes Discret. Math.
  • 2001
Recurrent construction of Z 4 -linear Hadamard codes is given and pairwise nonequivalent Z 3 -linear extended perfect codes are given. Expand
Spectra of finite linear and unitary groups
The spectrum of a finite group is the set of its element orders. An arithmetic criterion determining whether a given natural number belongs to a spectrum of a given group is furnished for all finiteExpand
The rank and kernel of extended 1-perfect Z4-linear and additive non-Z4-linear codes
1-perfect additive codes were completely characterized and by using that characterization the authors compute the possible parameters /spl alpha/, /spl beta/, rank, and dimension of the kernel for extended 1-perfect multiplier codes. Expand