Transitive nonpropelinear perfect codes (Q482224): Difference between revisions

A binary code \(C\) is transitive if there is a subgroup of the automorphism group \(H\) acting transitively on the code. Moreover, if such subgroup is regular, i.e. there exists a unique \(h \in H\) such that \(h(x)=y\) for every distinct \(x,y \in C\), then the code is called propelinear. It was known that there is only one transitive perfect code of length 15 that is nonpropelinear. By considering the Mollard code, the authors extend the previous result: it is proved that there exists a transitive nonpropelinear perfect code for any length greater than or equal to 15. Furthermore, they show that there are at least 5 pairwise nonequivalent such codes for any length greater than or equal to 255.