Geodesic
On partitions of $q$-ary Hamming codes into disjoint components
Diskretnyj analiz i issledovanie operacij, Tome 11 (2004) no. 3, pp. 80-87.

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

@article{DA_2004_11_3_a6,
     author = {A. M. Romanov},
     title = {On partitions of $q$-ary {Hamming} codes into disjoint components},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {80--87},
     publisher = {mathdoc},
     volume = {11},
     number = {3},
     year = {2004},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2004_11_3_a6/}
}
TY  - JOUR
AU  - A. M. Romanov
TI  - On partitions of $q$-ary Hamming codes into disjoint components
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2004
SP  - 80
EP  - 87
VL  - 11
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2004_11_3_a6/
LA  - ru
ID  - DA_2004_11_3_a6
ER  - 
%0 Journal Article
%A A. M. Romanov
%T On partitions of $q$-ary Hamming codes into disjoint components
%J Diskretnyj analiz i issledovanie operacij
%D 2004
%P 80-87
%V 11
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2004_11_3_a6/
%G ru
%F DA_2004_11_3_a6
A. M. Romanov. On partitions of $q$-ary Hamming codes into disjoint components. Diskretnyj analiz i issledovanie operacij, Tome 11 (2004) no. 3, pp. 80-87. http://geodesic.mathdoc.fr/item/DA_2004_11_3_a6/

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

[2] Vasilev Yu. L., “O negruppovykh plotno upakovannykh kodakh”, Problemy kibernetiki, no. 8, Fizmatgiz, M., 1962, 75–78

[3] Zinovev V. A., Lobstein A. S., “Ob obobschennykh kaskadnykh konstruktsiyakh sovershennykh dvoichnykh nelineinykh kodov”, Problemy peredachi informatsii, 36:4 (2000), 59–73 | MR

[4] Los A. V., “Postroenie sovershennykh $q$-znachnykh kodov posledovatelnymi sdvigami $\widetilde{\alpha}$-komponent”, Problemy peredachi informatsii, 40:1 (2004), 40–47 | MR | Zbl

[5] Mak-Vilyams F. Dzh., Sloen N. Dzh. A., Teoriya kodov, ispravlyayuschikh oshibki, Svyaz, M., 1979

[6] Malyugin S. A., “O perechislenii sovershennykh dvoichnykh kodov dliny 15”, Diskret. analiz i issled. operatsii. Ser. 2, 6:2 (1999), 48–73 | MR | Zbl

[7] Malyugin S. A., Romanov A. M., “O razbieniyakh kodov Khemminga na neperesekayuschiesya komponenty”, Diskret. analiz i issled. operatsii. Ser. 1, 9:1 (2002), 42–48 | MR | Zbl

[8] Romanov A. M., “O postroenii sovershennykh nelineinykh dvoichnykh kodov inversiei simvolov”, Diskret. analiz i issled. operatsii. Ser. 1, 4:1 (1997), 46–52 | MR | Zbl

[9] Etzion T., Vardy A., “Perfect binary codes: Constructions, properties and enumeration”, IEEE Trans. on Inform. Theory, 40:3 (1994), 754–763 | DOI | MR | Zbl

[10] Linström B., “On group and nongroup perfect codes in $q$ symbols”, Math. Scand., 25 (1969), 149–158 | MR

[11] Mollard M., “A generalized parity function and its use in the construction of perfect codes”, SIAM J. Algebraic Discrete Methods, 7:1 (1986), 113–115 | DOI | MR | Zbl

[12] Phelps K. T., “A product construction for perfect codes over arbitrary alphabets”, IEEE Trans. on Inform. Theory, 30:5 (1984), 769–771 | DOI | MR | Zbl

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

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

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

[16] Zinoviev V. A., Leontiev V. K., “The nonexistence of perfect codes over Galois field”, Probl. Control and Inform. Theory, 2:2 (1973), 16–24