Geodesic
On partitions of an $n$-cube into perfect binary codes
Diskretnyj analiz i issledovanie operacij, Tome 20 (2013) no. 2, pp. 15-25.

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

A switching construction of partitions of an $n$-cube is studied. A new lower bound on the number of such partitions of rank that exceeds the rank of the Hamming code of the same length at most by 2 is established. Bibliogr. 17.
Keywords: perfect binary code, rank of partition into perfect codes, lower bound on the number of partitions.
Mots-clés : partition of an $n$-cube 
@article{DA_2013_20_2_a1,
     author = {G. K. Guskov},
     title = {On partitions of an $n$-cube into perfect binary codes},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {15--25},
     publisher = {mathdoc},
     volume = {20},
     number = {2},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2013_20_2_a1/}
}
TY  - JOUR
AU  - G. K. Guskov
TI  - On partitions of an $n$-cube into perfect binary codes
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2013
SP  - 15
EP  - 25
VL  - 20
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2013_20_2_a1/
LA  - ru
ID  - DA_2013_20_2_a1
ER  - 
%0 Journal Article
%A G. K. Guskov
%T On partitions of an $n$-cube into perfect binary codes
%J Diskretnyj analiz i issledovanie operacij
%D 2013
%P 15-25
%V 20
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2013_20_2_a1/
%G ru
%F DA_2013_20_2_a1
G. K. Guskov. On partitions of an $n$-cube into perfect binary codes. Diskretnyj analiz i issledovanie operacij, Tome 20 (2013) no. 2, pp. 15-25. http://geodesic.mathdoc.fr/item/DA_2013_20_2_a1/

[1] Avgustinovich S. V., Solovëva F. I., “Postroenie sovershennykh dvoichnykh kodov posledovatelnymi sdvigami $\alpha$-komponent”, Probl. peredachi inform., 33:3 (1997), 15–21 | MR | Zbl

[2] Avgustinovich S. V., Solovëva F. I., Kheden U., “O razbieniyakh $n$-kuba na neekvivalentnye sovershennye kody”, Probl. peredachi inform., 43:4 (2007), 45–50 | MR | Zbl

[3] Vasilev Yu. L., “O negruppovykh plotno upakovannykh kodakh”, Probl. kibernetiki, 8, 1962, 337–339 | MR

[4] Guskov G. K., “O chisle razlichnykh razbienii kuba $E^{15}$ na sovershennye dvoichnye kody”, Mat. 47 mezhdunar. nauch. stud. konf. “Student i nauchno-tekhnicheskii progress”, Novosib. gos. un-t, Novosibirsk, 2009, 160

[5] Guskov G. K., Solovëva F. I., “Ob odnoi kaskadnoi konstruktsii razbienii $n$-kuba na sovershennye dvoichnye kody”, Tr. mezhdunar. konf. “Informatsionnye tekhnologii i sistemy” (Rossiya, Petrozavodsk, 19–25 avgusta 2012 g.), IPPI RAN, M., 2012, 124–128

[6] Krotov D. S., “Nizhnie otsenki chisla $m$-kvazigrupp poryadka 4 i chisla sovershennykh dvoichnykh kodov”, Diskret. analiz i issled. operatsii. Ser. 1, 7:2 (2000), 47–53 | MR | Zbl

[7] Solovëva F. I., “O dvoichnykh negruppovykh kodakh”, Metody diskretnogo analiza v izuchenii bulevykh funktsii i grafov, 37, In-t matematiki SO RAN, Novosibirsk, 1981, 65–76 | MR

[8] Solovëva F. I., “O tranzitivnykh razbieniyakh $n$-kuba na kody”, Probl. peredachi inform., 45:1 (2009), 27–35 | MR | Zbl

[9] Solovëva F. I., Guskov G. K., “O postroenii vershinno-tranzitivnykh razbienii $n$-kuba na sovershennye kody”, Diskret. analiz i issled. operatsii, 17:3 (2010), 84–100 | MR

[10] Solovëva F. I., Los A. V., “O postroenii razbienii na sovershennye $q$-znachnye kody”, Diskret. analiz i issled. operatsii, 16:3 (2009), 63–73 | MR

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

[12] Avgustinovich S. V., Lobstein A., Solov'eva F. I., “Intersection matrices for partitions by binary perfect codes”, IEEE Trans. Inform. Theory, 47:4 (2001), 1621–1624 | MR | Zbl

[13] Heden O., Solov'eva F. I., “Partitions of $\mathbb F^n$ into nonparallel Hamming codes”, Adv. Math. Commun., 3:4 (2009), 385–397 | MR | Zbl

[14] Krotov D. S., Avgustinovich S. V., “On the number of 1-perfect binary codes: a lower bound”, IEEE Trans. Inf. Theory, 54:4 (2008), 1760–1765 | MR

[15] Östergård P. R. J., “On a hypercube coloring problem”, J. Comb. Theory. Ser. A, 108:2 (2004), 199–204 | MR

[16] Phelps K. T., “An enumeration of 1-perfect binary codes”, Australas. J. Comb., 21 (2000), 287–298 | MR | Zbl

[17] Solov'eva F. I., On perfect codes and related topics, Com$^2$Mac Lect. Notes Ser., 13, Pohang Univ. Sci. Tech., Pohang, Korea, 2004, 80 pp.