Geodesic
Distance regular colorings of the infinite rectangular grid
Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 3, pp. 3-10.

Voir la notice de l'article provenant de la source Math-Net.Ru

The parameters of all distance regular colorings of the infinite rectangular grid are listed. Ill. 8, bibliogr. 15.
Keywords: perfect coloring, completely regular code, infinite rectangular grid.
Mots-clés : equitable partition, partition design 
@article{DA_2011_18_3_a0,
     author = {S. V. Avgustinovich and A. Yu. Vasil'eva and I. V. Sergeeva},
     title = {Distance regular colorings of the infinite rectangular grid},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {3--10},
     publisher = {mathdoc},
     volume = {18},
     number = {3},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2011_18_3_a0/}
}
TY  - JOUR
AU  - S. V. Avgustinovich
AU  - A. Yu. Vasil'eva
AU  - I. V. Sergeeva
TI  - Distance regular colorings of the infinite rectangular grid
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2011
SP  - 3
EP  - 10
VL  - 18
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2011_18_3_a0/
LA  - ru
ID  - DA_2011_18_3_a0
ER  - 
%0 Journal Article
%A S. V. Avgustinovich
%A A. Yu. Vasil'eva
%A I. V. Sergeeva
%T Distance regular colorings of the infinite rectangular grid
%J Diskretnyj analiz i issledovanie operacij
%D 2011
%P 3-10
%V 18
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2011_18_3_a0/
%G ru
%F DA_2011_18_3_a0
S. V. Avgustinovich; A. Yu. Vasil'eva; I. V. Sergeeva. Distance regular colorings of the infinite rectangular grid. Diskretnyj analiz i issledovanie operacij, Tome 18 (2011) no. 3, pp. 3-10. http://geodesic.mathdoc.fr/item/DA_2011_18_3_a0/

[1] Avgustinovich S. V., Borodin O. V., Frid A. E., “Distributivnye raskraski ploskikh triangulyatsii minimalnoi stepeni 5”, Diskret. analiz i issled. operatsii. Ser. 1, 8:1 (2001), 3–16 | MR

[2] Avgustinovich S. V., Vasileva A. Yu., “Teoremy vosstanovleniya dlya tsentrirovannykh funktsii i sovershennykh kodov”, Sib. mat. zhurn., 49:3 (2008), 483–489 | MR | Zbl

[3] Avgustinovich S. V., Vasileva A. Yu., “Vychislenie tsentrirovannoi funktsii po eë znacheniyam na srednikh sloyakh buleva kuba”, Diskret. analiz i issled. operatsii. Cer. 1, 10:2 (2003), 3–16 | MR | Zbl

[4] Avgustinovich S. V., Lisitsyna M. A., “Sovershennye 2-raskraski tranzitivnykh kubicheskikh grafov”, Diskret. analiz i issled. operatsii, 18:2 (2011), 3–17

[5] Avgustinovich S. V., Mogilnykh I. Yu., “Sovershennye raskraski grafov Dzhonsona $J(8,3)$ i $J(8,4)$ v dva tsveta”, Diskret. analiz i issled. operatsii, 17:2 (2010), 3–19 | MR

[6] Vorobev K. V., Fon-Der-Flaass D. G., “O sovershennykh 2-raskraskakh giperkuba”, Sib. elektron. mat. izv., 7 (2010), 65–75 | MR

[7] Krotov D. S., “O sovershennykh raskraskakh polovinnogo 24-kuba”, Diskret. analiz i issled. operatsii, 15:5 (2008), 35–46 | MR

[8] Puzynina S. A., “Sovershennye raskraski vershin grafa $G(\mathbb Z^2)$ v tri tsveta”, Diskret. analiz i issled. operatsii. Ser. 2, 12:1 (2005), 37–54 | MR

[9] Semakov N. V., Zaitsev G. V., Zinovev V. A., “Ravnomerno upakovannye kody”, Problemy peredachi informatsii, 7:1 (1971), 38–50 | MR | Zbl

[10] Fon-Der-Flaass D. G., “Sovershennye 2-raskraski giperkuba”, Sib. mat. zhurn., 48:4 (2007), 923–930 | MR | Zbl

[11] Khoroshilova D. B., “O tsirkulyarnykh sovershennykh raskraskakh v dva tsveta”, Diskret. analiz i issled. operatsii, 16:1 (2009), 80–92 | MR

[12] Avgustinovich S. V., Mogilnykh I. Yu., “Perfect 2-colorings of Johnson graphs $J(6,3)$ and $J(7,3)$”, Lect. Notes Comput. Sci., 5228, Springer-Verl., Berlin, 2008, 11–19 | MR | Zbl

[13] Axenovich M., “On multiple coverings of the infinite rectangular grid with balls of constant radius”, Discrete Math., 268:1–3 (2003), 31–49 | DOI | MR

[14] Delsarte P., “An algebraic approach to the association schemes of coding theory”, Philips Research Reports Supplements, 10 (1973), 1–97 | MR

[15] Puzynina S. A., Avgustinovich S. V., “On periodicity of two-dimensional words”, Theoret. Comput. Sci., 391 (2008), 178–187 | DOI | MR | Zbl