Completely regular codes: tables of small parameters for binary and ternary Hamming graphs Full article
| Source | Completely Regular Codes in Distance-Regular Graphs Monography, Chapman & Hall. 2025. 504 c. ISBN 9781032494449. |
||||||
|---|---|---|---|---|---|---|---|
| Output data | Year: 2025, Number: Chapter 7, Pages: 1-52 Pages count : 52 | ||||||
| Authors |
|
||||||
| Affiliations |
|
Funding (1)
| 1 | Sobolev Institute of Mathematics | FWNF-2022-0017 |
Abstract:
In this chapter, we present tables of small parameters of completely regular (CR) codes in Hamming graphs H(n, q), q = 2, 3. We list all putative intersection arrays with intersection numbers up to some limit (depending on the covering radius) that pass some basic tests (see Sections 7.1.1, 7.1.2, 7.1.5, 7.1.4) and, for each array A, show the best known lower and upper (if exists) bounds on the smallest n such that an A-CR code exists in H(n, q).
Cite:
Koolen J.H.
, Krotov D.S.
, Martin W.J.
Completely regular codes: tables of small parameters for binary and ternary Hamming graphs
Monography chapter Completely Regular Codes in Distance-Regular Graphs. – Chapman & Hall., 2025. – C.1-52. – ISBN 9781032494449.
Completely regular codes: tables of small parameters for binary and ternary Hamming graphs
Monography chapter Completely Regular Codes in Distance-Regular Graphs. – Chapman & Hall., 2025. – C.1-52. – ISBN 9781032494449.
Dates:
| Published print: | Nov 6, 2024 |
| Published online: | Mar 14, 2025 |
Identifiers:
No identifiers
Citing:
Пока нет цитирований