Voir la notice de l'article provenant de la source Math-Net.Ru
[1] Mak-Vilyams Dzh., Sloen N., Teoriya kodov, ispravlyayuschikh oshibki, Svyaz, M., 1979
[2] Yablonskii S. V., “Funktsionalnye postroeniya v $k$-znachnoi logike”, Tr. MIAN SSSR, 151, M., 1958, 5–142
[3] Gavrilov G. P., Sapozhenko A. A., Zadachi i uprazhneniya po kursu diskretnoi matematiki, Nauka, M., 1992 | MR | Zbl
[4] Leontiev V., Moreno O., On the boolean polynomials, Preprint Gauss Res. Lab. San-Juan, Univ. of Puerto-Rico, 1995
[5] Lidl R., Niederreiter H., Finite fields, Univ. Press and Addison Wesley, Cambridge, 1983 | MR | Zbl
[6] Aleksanyan A. A., Diz'yunktivnye normalnye nad lineinymi funktsiyami, Erevanskii un-t, Erevan, 1990 | MR | Zbl
[7] Eherenfeucht A., Karpinski M., The computational complexity of (XOR, AND) counting problems, Preprint, Univ., Bonn, 1989 | MR
[8] Leontev V. K., Moreno O., “O nulyakh bulevykh polinomov”, Zh. vychisl. matem. i matem. fiz., 38:9 (1998), 1608–1615 | MR