Name
Abstract | ||
|---|---|---|
The dodecacode is a nonlinear additive quaternary code of length 12. By puncturing it at any of the twelve coordinates, we obtain a uniformly packed code of distance 5. In particular, this latter code is completely regular but not completely transitive. Its coset graph is distance-regular of diameter three on \(2^{10}\) vertices, with new intersection array \(\{33,30,15;1,2,15\}\). The automorphism groups of the code, and of the graph, are determined. Connecting the vertices at distance two gives a strongly regular graph of (previously known) parameters \((2^{10}, 495,238, 240)\). Another strongly regular graph with the same parameters is constructed on the codewords of the dual code. A non trivial completely regular binary code of length 33 is constructed. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/s10623-019-00609-w | Designs, Codes and Cryptography |
Keywords | Field | DocType |
Distance-regular graphs, Completely regular codes, Uniformly packed codes, Additive quaternary codes, 05E30, 94B05 | Discrete mathematics,Combinatorics,Strongly regular graph,Vertex (geometry),Automorphism,Binary code,Distance-regular graph,Coset,Mathematics,Puncturing,Dual code | Journal |
Volume | Issue | ISSN |
abs/1806.07069 | 9 | 0925-1022 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Minjia Shi | 1 | 28 | 20.11 |
| Denis S. Krotov | 2 | 86 | 26.47 |
| Patrick Solé | 3 | 636 | 89.68 |