Sciact
  • EN
  • RU

Equitable partitions in the Doob graphs Доклады на конференциях

Язык Английский
Тип доклада Секционный
Конференция Sixteenth International Workshop on Algebraic and Combinatorial Coding Theory
02-08 сент. 2018 , Светлогорск (Калининградская область)
Авторы Bespalov Evgeny 1
Организации
1 Институт математики им. С.Л. Соболева СО РАН

Реферат: Equitable partitions are related to many classic objects of coding theory. For example, a completely regular code corresponds to an equitable partition. Otherwise, an equitable 2-partition is always a completely regular code with radius 1. We study the possible parameters of equitable partitions in the Doob graphs. Some infinite series of equitable partitions in the Doob graphs are obtained in this thesis. Also, we established which MDS codes in the Doob graphs are completely regular codes.
Библиографическая ссылка: Bespalov E.
Equitable partitions in the Doob graphs
Sixteenth International Workshop on Algebraic and Combinatorial Coding Theory 02-08 Sep 2018