Corpus ID: 117372004

On homogeneous nontransitive binary perfect code

  title={On homogeneous nontransitive binary perfect code},
  author={I.Yu.Mogilnykh and F. Solov'eva},
  journal={arXiv: Combinatorics},
Studying binary perfect codes we show the existence of homogeneous nontransitive codes. Thus, as far as perfect codes are concerned, the propelinear codes are strictly contained in transitive codes, wheresas homogeneous codes form a strict subclass of transitive codes. In the work we deduce a necessary and sufficient condition for transitivity of perfect binary codes of rank one more than that of Hamming code. The paper is in Russian. 


Structural properties of binary propelinear codes
It is shown that there exists a binary code, the Best code of length 10, size 40 and minimum distance 4, which is transitive but not propelinear, and a lower bound is given on the number of nonequivalent Propelinear perfect binary codes. Expand
On Completely Regular Propelinear Codes
In a previous paper (see [7]) we found that given a distance regular e-latticed graph γ we can associate with it a completely regular code C. We used this in order to solve a conjecture given byExpand
The Perfect Binary One-Error-Correcting Codes of Length $15$: Part I—Classification
A complete classification of the perfect binary one-error-correcting codes of length 15 as well as their extensions of length 16 is presented, using the recent classification of Steiner quadruple systems of order 16. Expand
On symmetry group of Mollard code
For a pair of given binary perfect codes C and D of lengths t and m respectively, the Mollard construction outputs a perfect code M(C,D) of length tm + t +m, having subcodes C and D, that areExpand
Existence of transitive nonpropelinear perfect codes
  • Discrete Mathematics
  • 2015
Transitive 1-perfect codes from quadratic functions
On the number of inequivalent Steiner triple systems
  • J. Combinatorial Theory
  • 1966
On the number of inequivalent steiner triple systems