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] Alon N., Friedland S., Kalai G., “Regular subgraphs of almost regular graphs”, J. Combinatory Theory. Ser. B, 37 (1984), 79–91 | DOI | Zbl
[3] Aleksanyan A. A., Diz'yunktivnye normalnye formy nad lineinymi funktsiyami, Ergu, Erevan, 1990
[4] Eherenfeucht A., Karpinski M., The computational complexity of (XOR, AND)-counting problems, Preprint, Univ. Bohn, Bohn, 1989
[5] Karpinski M., Luby M., Approximating the number of solutions of a YF(2), Polynomial Manuscript, 1989
[6] Leontiev V., Moreno O., On the zeros of Boolean polynomials, preprint, Gauss Res. Lab. Univ., Puerto-Rico, San-Juan, 1995
[7] Moreno O., Cauras A., Alonso M., Some properties of the ring normal form of Boolean functions, Preprint, Gauss Res. Lab. Univ., Puerto-Rico, San-Juan, 1992
[8] Leontiev V., Moreno O., On the Boolean polynomials, Preprint, Gauss Res. Lab. Univ., Puerto-Rico, San-Juan, 1995
[9] Leontev V. K., “Verkhnyaya otsenka $\alpha$-glubiny (0,1) matrits”, Matem. zametki, 15:3 (1974), 421–429 | MR
[10] Lidl R., Niderreiter H., Finite fields, Cambridge Univ. Press, Addison Wesley, Cambridge, 1983 | Zbl