Transitive nonpropelinear perfect codes
From MaRDI portal
Publication:482224
DOI10.1016/J.DISC.2014.11.001zbMATH Open1336.94090arXiv1411.2692OpenAlexW2023683772MaRDI QIDQ482224FDOQ482224
Authors: Ivan Yu. Mogilnykh, Faina I. Solov'eva 
Publication date: 19 December 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
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 , .
Full work available at URL: https://arxiv.org/abs/1411.2692
Recommendations
Cites Work
- The Magma algebra system. I: The user language
- Structural properties of binary propelinear codes
- On the structure of symmetry groups of Vasil'ev codes
- On the construction of transitive codes
- Propelinear 1-Perfect Codes From Quadratic Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- A characterization of 1-perfect additive codes
- The Perfect Binary One-Error-Correcting Codes of Length 15: Part II—Properties
- On binary 1-perfect additive codes: some structural properties
- A Generalized Parity Function and Its Use in the Construction of Perfect Codes
- Ranks of incidence matrices of Steiner triple systems
- Perfect binary \((n,3)\) codes: The structure of graphs of minimum distances
- On isometry of close-packed binary codes
- On the number of nonequivalent propelinear extended perfect codes
- 1-perfect uniform and distance invariant partitions
- Ranks of propelinear perfect binary codes
Cited In (21)
- On the nonexistence of completely transitive codes
- On separability of the classes of homogeneous and transitive perfect binary codes
- Nonequivalent q-Ary Perfect Codes
- Title not available (Why is that?)
- On \(q\)-ary propelinear perfect codes based on regular subgroups of the general affine group
- Entry-faithful 2-neighbour transitive codes
- 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
- Title not available (Why is that?)
- On extremely transitive extended perfect codes
- On the construction of transitive 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
- Translation-invariant propelinear codes
- A concatenation construction for propelinear perfect codes from regular subgroups of \(\mathrm{GA}(r,2)\)
- On the number of nonequivalent propelinear extended perfect codes
Uses Software
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)
