Equitable partitions in the Doob graphs Conference attendances
| Language | Английский | ||
|---|---|---|---|
| Participant type | Секционный | ||
| Conference |
Sixteenth International Workshop on Algebraic and
Combinatorial Coding Theory 02-08 Sep 2018 , Светлогорск (Калининградская область) |
||
| Authors |
|
||
| Affiliations |
|
Abstract:
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.
Cite:
Bespalov E.
Equitable partitions in the Doob graphs
Sixteenth International Workshop on Algebraic and Combinatorial Coding Theory 02-08 Sep 2018
Equitable partitions in the Doob graphs
Sixteenth International Workshop on Algebraic and Combinatorial Coding Theory 02-08 Sep 2018