Perfect bitrades in Johnson graphs Full article
| Conference |
2023 XVIII International Symposium on Problems of Redundancy in Information and Control Systems 24-27 Oct 2023 , Москва, МИЭМ ВШЭ |
||
|---|---|---|---|
| Source | 2023 XVIII International Symposium on Problems of Redundancy in Information and Control Systems (REDUNDANCY) Compilation, 2023. 204 c. |
||
| Output data | Year: 2023, Pages: 54-58 Pages count : 5 DOI: 10.1109/Redundancy59964.2023.10330180 | ||
| Tags | perfect code, t-design, perfect bitrade, spherical bitrade, component, Delsarte hypothesis, constant weight code, Hadamard design, Nordstrom-Robinson code | ||
| Authors |
|
||
| Affiliations |
|
Funding (1)
| 1 | Russian Science Foundation | 22-11-00266 |
Abstract:
Показано существование двух совершенных битрейдов в графах Джонсона J(14,7) и J(18,7). Доказано несуществование совершенных битрейдов в графах Джонсона J(2w+1,w) J(2w+2,w) и J(2w+3,w) для любого w>1.
Cite:
Mogilnykh I.
, Vorob'ev K.
Perfect bitrades in Johnson graphs
In compilation 2023 XVIII International Symposium on Problems of Redundancy in Information and Control Systems (REDUNDANCY). 2023. – C.54-58. DOI: 10.1109/Redundancy59964.2023.10330180 Scopus OpenAlex
Perfect bitrades in Johnson graphs
In compilation 2023 XVIII International Symposium on Problems of Redundancy in Information and Control Systems (REDUNDANCY). 2023. – C.54-58. DOI: 10.1109/Redundancy59964.2023.10330180 Scopus OpenAlex
Dates:
| Published print: | Dec 4, 2023 |
| Published online: | Dec 4, 2023 |
Identifiers:
| Scopus: | 2-s2.0-85180153021 |
| OpenAlex: | W4389313706 |
Citing:
Пока нет цитирований