Completely regular codes: tables of small parameters for binary and ternary Hamming graphs | Sciact - Система учета научной деятельности ИМ СО РАН

Completely regular codes: tables of small parameters for binary and ternary Hamming graphs Научная публикация

Сборник

Completely Regular Codes in Distance-Regular Graphs
Монография, Chapman & Hall. 2025. 504 c. ISBN 9781032494449.

Вых. Данные

Год: 2025, Номер: Chapter 7, Страницы: 1-52 Страниц : 52

Авторы

Koolen Jacobus H. ¹ , Krotov Denis S. ² , Martin William J. ³

Организации

1	University of Science and Technology of China
2	Sobolev Institute of Mathematics
3	Worcester Polytechnic Institute

Информация о финансировании (1)

Институт математики им. С.Л. Соболева СО РАН

FWNF-2022-0017

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).

Koolen J.H. , Krotov D.S. , Martin W.J.
Completely regular codes: tables of small parameters for binary and ternary Hamming graphs
Глава монографии Completely Regular Codes in Distance-Regular Graphs. – Chapman & Hall., 2025. – C.1-52. – ISBN 9781032494449.

Опубликована в печати:	6 нояб. 2024 г.
Опубликована online:	14 мар. 2025 г.

Нет идентификаторов

Пока нет цитирований