Name
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 Östergård and Pottonen (2009) there is a unique nonpropelinear code. We solve the existence problem for transitive nonpropelinear perfect codes for any admissible length n, n≥15. Moreover we prove that there are at least 5 pairwise nonequivalent such codes for any admissible length n, n≥255. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.disc.2014.11.001 | Discrete Mathematics |
Keywords | Field | DocType |
Perfect code,Mollard code,Transitive action,Regular action | Discrete mathematics,Combinatorics,Group code,Ternary Golay code,Polynomial code,Linear code,Hamming bound,Transitive closure,Prefix code,Mathematics,Transitive relation | Journal |
Volume | Issue | ISSN |
338 | 3 | 0012-365X |
Citations | PageRank | References |
3 | 0.46 | 14 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ivan Yu. Mogilnykh | 1 | 36 | 8.74 |
| Faina I. Solov'eva | 2 | 3 | 0.46 |