13 citations · 18 across the 7 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
math.CO2020
On extended 1-perfect bitrades
Evgeny A. Bespalov, Denis S. Krotov
Extended -perfect codes in the Hamming scheme can be equivalently defined as codes that turn to -perfect codes after puncturing in any coordinate, as completely regu…
math.CO2020★ 1 cited
On the non-existence of extended perfect codes and some perfect colorings
Evgeny Bespalov
In this paper we obtain the necessary condition for the existence of perfect -colorings (equitable -partitions) in Hamming graphs , where and Doob graphs $D…