Geodesic
On partitions into perfect $q$-ary codes
Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 3, pp. 63-73.

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

For any admissible $N$ we present two constructions of different partitions of the $N$-dimensional vector space over $GF(q)$ into perfect $q$-ary codes, where $q>2$ is a power of a prime. The lower bounds on the number of such partitions are given. Bibl. 12. 
@article{DA_2009_16_3_a3,
     author = {F. I. Solov'eva and A. V. Los'},
     title = {On partitions into perfect $q$-ary codes},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {63--73},
     publisher = {mathdoc},
     volume = {16},
     number = {3},
     year = {2009},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2009_16_3_a3/}
}
TY  - JOUR
AU  - F. I. Solov'eva
AU  - A. V. Los'
TI  - On partitions into perfect $q$-ary codes
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2009
SP  - 63
EP  - 73
VL  - 16
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2009_16_3_a3/
LA  - ru
ID  - DA_2009_16_3_a3
ER  - 
%0 Journal Article
%A F. I. Solov'eva
%A A. V. Los'
%T On partitions into perfect $q$-ary codes
%J Diskretnyj analiz i issledovanie operacij
%D 2009
%P 63-73
%V 16
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2009_16_3_a3/
%G ru
%F DA_2009_16_3_a3
F. I. Solov'eva; A. V. Los'. On partitions into perfect $q$-ary codes. Diskretnyj analiz i issledovanie operacij, Tome 16 (2009) no. 3, pp. 63-73. http://geodesic.mathdoc.fr/item/DA_2009_16_3_a3/

[1] Avgustinovich S. V., Soloveva F. I., Kheden U., “O razbieniyakh $n$-kuba na neekvivalentnye sovershennye kody”, Problemy peredachi informatsii, 43:4 (2007), 45–50 | MR | Zbl

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

[3] Guskov G. K., “O chisle razlichnykh razbienii kuba $E^{15}$ na sovershennye dvoichnye kody”, Materialy 47-i mezhdunarodnoi nauchnoi studencheskoi konferentsii “Student i nauchno-tekhnicheskii progress”: Matematika, Novosibirskii gos. un-t, Novosibirsk, 2009, 160

[4] Zinovev V. A., Leontev V. K., O sovershennykh kodakh, Preprint, Vyp. 1, IPPI AN SSSR, 1972, 26–35 | MR

[5] Zinovev V. A., Leontev V. K., “Nesuschestvovanie sovershennykh kodov nad polyami Galua”, Problemy upravleniya i teorii informatsii, 1973, no. 2, 123–132 | MR

[6] Los A. V., “Postroenie sovershennykh $q$-ichnykh kodov svitchingami prostykh komponent”, Problemy peredachi informatsii, 42:1 (2006), 34–42 | MR | Zbl

[7] Timashëv A. N., “O permanentakh sluchainykh dvazhdy stokhasticheskikh matrits i asimptoticheskikh otsenkakh chisel latinskikh pryamougolnikov i latinskikh kvadratov”, Diskret. matematika, 14:4 (2002), 65–86 | MR | Zbl

[8] Cohen G., Honkala I., Lobstein A., Litsyn S., Covering codes, Elsevier, Amsterdam–Lausanne–New York–Oxford–Shannon–Tokyo, 1998, 542 pp. | MR

[9] Phelps K. T., Villanueva M., “Ranks of $q$-ary 1-perfect codes”, Des. Codes Cryptogr., 27 (2002), 139–144 | DOI | MR | Zbl

[10] Schönheim J., “On linear and nonlinear single-error-correcting $q$-ary 1-perfect codes”, Inform. Control., 12 (1986), 23–26 | DOI | MR

[11] Solov'eva F. I., On perfect codes and related topics, Com Mac Lecture Note. Series, 13, Pohang, 2004, 80 pp.

[12] Tietäväinen A., “On the nonexistence of perfect codes over finite fields”, SIAM J. Appl. Math., 24 (1973), 88–96 | DOI | MR | Zbl