@article{UZERU_1989_2_a3,
author = {G. L. Movsisyan and Zh. G. Margaryan},
title = {On fixed-weight perfect codes},
journal = {Proceedings of the Yerevan State University. Physical and mathematical sciences},
pages = {21--23},
year = {1989},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/UZERU_1989_2_a3/}
}
G. L. Movsisyan; Zh. G. Margaryan. On fixed-weight perfect codes. Proceedings of the Yerevan State University. Physical and mathematical sciences, no. 2 (1989), pp. 21-23. http://geodesic.mathdoc.fr/item/UZERU_1989_2_a3/
[1] C. V. Freiman, “Upper bounds for fixed-weight codes of specified minimum distance”, IEHE Trans. Inform. Theory, 1904, no. 10, 246–248
[2] S. P. Lloid, “Binarnoe blochnoe kodirovanie”, Kiberneticheskii sbornik, 1960, no. 1, 206–226, Izd-vo inostr. lit., M.
[3] F. Dalsart, Algebraicheskii podkhod k sistemam otnoshenii teorii kodirovaniya, Mir, M., 1976, 134 pp.
[4] N. L. Biggs, “Perfekt codes in Graphs”, J. Comb. Tlieori, 15V (1973), 289–290 | DOI
[5] V. A. Zinovev, V. K. Leontev, “Nesuschestvovanie sovershennykh kodov nad polyami Galua”, Problemy upravleniya i teorii informatsii, 1973, no. 2, 123–132 | MR
[6] A. Tietäväinen, “On the nonexistence of perfect codes over finite fields”, SIAM J. Applied Math., 24:1 (1973), 88–96 | DOI | MR | Zbl
[7] P. Kameron, Dzh. Van Lint, Teoriya grafov, teoriya kodirovaniya i blok-skhemy, Nauka, M., 1980, 144 pp. | MR
[8] G. L. Movsisyan, “Sovershennye kody v skhemakh Dzhonsona”, Vestn. Mosk. un-ta. Ser. 15. Vychisl. Matem. Kibern., 1982, no. 1, 64–69 | Zbl
[9] F. Dzh. Mak-Vilyams, N. Dzh. A. Sloen, Teoriya kodov, ispravlyayuschikh oshibki, Svyaz, M., 1979 | MR | Zbl
[10] N. V. Semakov, V. A. Zinovev, “Sovershennye i kvazisovershennye ravnovesnye kody”, Probl. peredachi inform., 5:2 (1969), 14–18 | MR | Zbl