Geodesic
Construction of partitions of the set of all $p$-ary vectors of length $p+1$ into Hamming codes
Sibirskie èlektronnye matematičeskie izvestiâ, Tome 8 (2011), pp. 372-380.

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

We suggest the construction of a partition of the set of all $p$‑ary vectors of length $p+1$ into perfect $p$-ary codes, where $p$ is a prime. The construction yields the lower bound $N(p)>(e^{\pi\sqrt{2p/3}})/(4p\sqrt{3})$ on the number of nonequivalent such partitions for any prime $p$.
Keywords: perfect $q$-ary code, Hamming code, switchings.
Mots-clés : partition into codes 
@article{SEMR_2011_8_a31,
     author = {A. V. Los' and K. I. Burnakov},
     title = {Construction of partitions of the set of all $p$-ary vectors of length $p+1$ into {Hamming} codes},
     journal = {Sibirskie \`elektronnye matemati\v{c}eskie izvesti\^a},
     pages = {372--380},
     publisher = {mathdoc},
     volume = {8},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SEMR_2011_8_a31/}
}
TY  - JOUR
AU  - A. V. Los'
AU  - K. I. Burnakov
TI  - Construction of partitions of the set of all $p$-ary vectors of length $p+1$ into Hamming codes
JO  - Sibirskie èlektronnye matematičeskie izvestiâ
PY  - 2011
SP  - 372
EP  - 380
VL  - 8
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/SEMR_2011_8_a31/
LA  - ru
ID  - SEMR_2011_8_a31
ER  - 
%0 Journal Article
%A A. V. Los'
%A K. I. Burnakov
%T Construction of partitions of the set of all $p$-ary vectors of length $p+1$ into Hamming codes
%J Sibirskie èlektronnye matematičeskie izvestiâ
%D 2011
%P 372-380
%V 8
%I mathdoc
%U http://geodesic.mathdoc.fr/item/SEMR_2011_8_a31/
%G ru
%F SEMR_2011_8_a31
A. V. Los'; K. I. Burnakov. Construction of partitions of the set of all $p$-ary vectors of length $p+1$ into Hamming codes. Sibirskie èlektronnye matematičeskie izvestiâ, Tome 8 (2011), pp. 372-380. http://geodesic.mathdoc.fr/item/SEMR_2011_8_a31/

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

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

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

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

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

[6] F. I. Soloveva, A. V. Los, “O postroenii razbienii $\mathbb{F}_q^N$ na sovershennye $q$-znachnye kody”, Diskret. analiz i issled. operatsii, 16:3 (2009), 63–73 | MR

[7] A. V. Los, F. I. Soloveva, “O razbieniyakh prostranstva $\mathbb{F}_q^N$ na affinno neekvivalentnye sovershennye $q$-znachnye kody”, Sib. elektron. matem. izvestiya, 7 (2010), 425–434 | MR

[8] A. A. Markov, “O preobrazovaniyakh, ne rasprostranyayuschikh iskazheniya”, Izbrannye trudy, v. II, Teoriya algoritmov i konstruktivnaya matematika, matematicheskaya logika, informatika i smezhnye voprosy, MTsNMO, M., 2003, 70–93

[9] O. Heden, F. I. Solov'eva, “Partitions of $\mathbb{F}^n$ into non-parallel Hamming codes”, Advanced in Mathematics of Communications, 13:4 (2009), 385–397 | MR

[10] G. Endryus, Teoriya razbienii, Per. s angl., Nauka. Glavnaya redaktsiya fiziko-matematicheskoi literatury, M., 1982, 256 pp. | MR

[11] G. Cohen, I. Honkala, A. Lobstein, S. Litsyn, Covering codes, Elsevier, 1998 | MR

[12] W. C. Huffman, Codes and groups, Handbook of coding theory, Elsevier, Amsterdam – New York, 1998 | MR

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

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

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