|
|
|
|
ЛИТЕРАТУРА
|
|
| |
| 1. |
Дельсарт Ф., Алгебраический подход к схемам отношений теории кодирования, Мир, М., 1976, 136 с.  |
| 2. |
Потапов В. Н., “Многомерные латинские битрейды”, Сиб. мат. журн., 52:2 (2013), 407–416  |
| 3. |
Cavenagh N. J., “The theory and application of latin bitrades: a survey”, Math. Slovaca, 58:6 (2008), 691–718    |
| 4. |
Etzion T., Vardy A., “Perfect binary codes: constructions, properties, and enumeration”, IEEE Trans. Inform. Theory, 40:3 (1994), 754–763 |
| 5. |
Hedayat A. S., Khosrovshahi G. B., “Trades”, CRC Handbook of Combinatorial Designs, Chapman and Hall/CRC, Boca Raton–London–New York, 2006, 644–648 |
| 6. |
Heden O., Krotov D. S., “On the structure of non-full-rank perfect $q$-ary codes”, Adv. Math. Comm., 5:2 (2011), 149–156 |
| 7. |
Phelps K. T., “A product construction for perfect codes over arbitrary alphabets”, IEEE Trans. Inf. Theory, 30:5 (1984), 769–771 |
| 8. |
Phelps K. T., Rifà J., Villanueva M., “Kernels and $p$-kernels of $p^r$-ary 1-perfect codes”, Des. Codes Cryptogr., 37:2 (2005), 243–261 |
| 9. |
Potapov V. N., “On perfect 2-colorings of the $q$-ary $n$-cube”, Discrete Math., 312:8 (2012), 1269–1272 |
| 10. |
Solov'eva F. I., “Structure of $i$-components of perfect binary codes”, Discrete Appl. Math., 111:1–2 (2001), 189–197 |
