Transitive nonpropelinear perfect codes (Q482224): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Diego Ruano / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 94B27 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6381964 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
perfect code | |||
Property / zbMATH Keywords: perfect code / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Mollard code | |||
Property / zbMATH Keywords: Mollard code / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
transitive action | |||
Property / zbMATH Keywords: transitive action / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
regular action | |||
Property / zbMATH Keywords: regular action / rank | |||
Normal rank |
Revision as of 19:35, 30 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Transitive nonpropelinear perfect codes |
scientific article |
Statements
Transitive nonpropelinear perfect codes (English)
0 references
19 December 2014
0 references
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.
0 references
perfect code
0 references
Mollard code
0 references
transitive action
0 references
regular action
0 references