Completely Regular Codes in Johnson and Grassmann Graphs with Small Covering Radii Научная публикация
| Журнал |
Electronic Journal of Combinatorics
ISSN: 1077-8926 , E-ISSN: 1097-1440 |
||
|---|---|---|---|
| Вых. Данные | Год: 2022, Том: 29, Номер: 2, Номер статьи : P2.57, Страниц : DOI: 10.37236/10083 | ||
| Авторы |
|
||
| Организации |
|
Информация о финансировании (1)
| 1 | Институт математики им. С.Л. Соболева СО РАН | FWNF-2022-0017 |
Реферат:
Let L be a Desarguesian 2-spread in the Grassmann graph Jq (n, 2). We prove that the collection of the 4-subspaces, which do not contain subspaces from L is a completely regular code in Jq (n, 4). Similarly, we construct a completely regular code in the Johnson graph J(n, 6) from the Steiner quadruple system of the extended Hamming code. We obtain several new completely regular codes with covering radius 1 in the Grassmann graph J2(6, 3) using binary linear programming. © The author.
Библиографическая ссылка:
Mogilnykh I.
Completely Regular Codes in Johnson and Grassmann Graphs with Small Covering Radii
Electronic Journal of Combinatorics. 2022. V.29. N2. P2.57 . DOI: 10.37236/10083 WOS Scopus РИНЦ OpenAlex
Completely Regular Codes in Johnson and Grassmann Graphs with Small Covering Radii
Electronic Journal of Combinatorics. 2022. V.29. N2. P2.57 . DOI: 10.37236/10083 WOS Scopus РИНЦ OpenAlex
Идентификаторы БД:
| Web of science: | WOS:000815708500001 |
| Scopus: | 2-s2.0-85132851336 |
| РИНЦ: | 49150115 |
| OpenAlex: | W3111291503 |