1. D. V. Ageev, “Bases of the Theory of Linear Selection. Code Demultiplexing,” in Proceedings of the Leningrad Experimental Institute of Communication (Experimental Institute of Communication, Leningrad, 1935), pp. 3–35.
2. A. C. Ambrosimov, “Properties of the Bent Functions of q-Ary Logic over Finite Fields,” Discrete Math. 6(3), 50–60 (1994).
3. A. V. Ivanov, “Using Some Reduced Representation of the Boolean Functions Under Constructing Their Nonlinear Approximations,” Vestnik Tomsk. Gos. Univ. Suppl. No. 23, 31–35 (2007).
4. A. V. Ivanov, “Approximation of the Plateaued Boolean Functions by Monomial Functions,” Prikl. Diskret. Mat. 1(1), 10–14 (2008).
5. A. V. Ivanov, “The Degree of Proximity of the Boolean Function Reduced Representation to the Class of Monomial Functions According to Basis Selection,” Prikl. Diskret. Mat. Suppl. No. 1, 7–9 (2009).