加载中…
We consider the problem of existence of perfect -colorings in the Doob graphs and -ary Hamming graphs . We characterize all parameters for which multifold -perfect code in exists. Also, we prove that for any pair that satisfy standard conditions (Lloyd’s and sphere-packing conditions) there is perfect -coloring in Doob graphs and Hamming graphs if diameter of graph and are sufficiently large ( not less than , or for some cases). Also we obtain some completely regular codes with covering radius .

生成讲解博客的中文版本

生成AI智能校验的中文版本