A new distance-regular graph of diameter 3 on 1024 vertices Научная публикация
| Журнал |
Designs, Codes and Cryptography
ISSN: 0925-1022 , E-ISSN: 1573-7586 |
||||||
|---|---|---|---|---|---|---|---|
| Вых. Данные | Год: 2019, Том: 87, Номер: 9, Страницы: 2091-2101 Страниц : 11 DOI: 10.1007/s10623-019-00609-w | ||||||
| Ключевые слова | Distance-regular graphs, completely regular codes, uniformly packed codes, additive quaternary codes | ||||||
| Авторы |
|
||||||
| Организации |
|
Реферат:
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.
Библиографическая ссылка:
Shi M.
, Krotov D.S.
, Solé P.
A new distance-regular graph of diameter 3 on 1024 vertices
Designs, Codes and Cryptography. 2019. V.87. N9. P.2091-2101. DOI: 10.1007/s10623-019-00609-w WOS Scopus РИНЦ OpenAlex
A new distance-regular graph of diameter 3 on 1024 vertices
Designs, Codes and Cryptography. 2019. V.87. N9. P.2091-2101. DOI: 10.1007/s10623-019-00609-w WOS Scopus РИНЦ OpenAlex
Даты:
| Поступила в редакцию: | 26 июн. 2018 г. |
| Принята к публикации: | 10 янв. 2019 г. |
| Опубликована online: | 24 янв. 2019 г. |
Идентификаторы БД:
| Web of science: | WOS:000483581300009 |
| Scopus: | 2-s2.0-85060695632 |
| РИНЦ: | 41616075 |
| OpenAlex: | W3105536874 |