Transitive nonpropelinear perfect codes
From MaRDI portal
Abstract: A code is called transitive if its automorphism group (the isometry group) of the code acts transitively on its codewords. If there is a subgroup of the automorphism group acting regularly on the code, the code is called propelinear. Using Magma software package we establish that among 201 equivalence classes of transitive perfect codes of length 15 from cite{ost} there is a unique nonpropelinear code. We solve the existence problem for transitive nonpropelinear perfect codes for any admissible length , . Moreover we prove that there are at least 5 pairwise nonequivalent such codes for any admissible length , .
Recommendations
Cites work
- scientific article; zbMATH DE number 4110626 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- 1-perfect uniform and distance invariant partitions
- A Generalized Parity Function and Its Use in the Construction of Perfect Codes
- A characterization of 1-perfect additive codes
- On binary 1-perfect additive codes: some structural properties
- On isometry of close-packed binary codes
- On the construction of transitive codes
- On the number of nonequivalent propelinear extended perfect codes
- On the structure of symmetry groups of Vasil'ev codes
- Perfect binary \((n,3)\) codes: The structure of graphs of minimum distances
- Propelinear 1-Perfect Codes From Quadratic Functions
- Ranks of incidence matrices of Steiner triple systems
- Ranks of propelinear perfect binary codes
- Structural properties of binary propelinear codes
- The Magma algebra system. I: The user language
- The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties
Cited in
(21)- On separability of the classes of homogeneous and transitive perfect binary codes
- On the nonexistence of completely transitive codes
- Nonequivalent q-Ary Perfect Codes
- scientific article; zbMATH DE number 7029854 (Why is no real title available?)
- Entry-faithful 2-neighbour transitive codes
- On \(q\)-ary propelinear perfect codes based on regular subgroups of the general affine group
- Propelinear codes related to some classes of optimal codes
- Theoretical Aspects of Computing – ICTAC 2005
- On the symmetry group of the Mollard code
- Codes with a certain weight-preserving transitive group of automorphisms
- scientific article; zbMATH DE number 2154099 (Why is no real title available?)
- On the construction of transitive codes
- On extremely transitive extended perfect codes
- 2-neighbour-transitive codes with small blocks of imprimitivity
- Diagonally neighbour transitive codes and frequency permutation arrays
- Constructions of transitive Latin hypercubeatin hypercubes
- Multiply transitivity of perfect 1-codes in symmetric groups
- Coordinate transitivity of a class of extended perfect codes and their SQS
- A concatenation construction for propelinear perfect codes from regular subgroups of \(\mathrm{GA}(r,2)\)
- Translation-invariant propelinear codes
- On the number of nonequivalent propelinear extended perfect codes
This page was built for publication: Transitive nonpropelinear perfect codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q482224)
