A. A. Babueva, O. A. Logachev, V. V. Yashchenko, “On the relationship between local affinities of a Boolean function and some types of its degeneracy”, Diskr. Mat., 34:2 (2022), 7–25; Discrete Math. Appl., 33:6 (2023), 339–353
O. A. Logachev, S. N. Fedorov, V. V. Yashchenko, “On some invariants under the action of an extension of $GA(n,2)$ on the set of Boolean functions”, Diskr. Mat., 33:2 (2021), 66–85; Discrete Math. Appl., 32:3 (2022), 177–192
O. A. Logachev, A. A. Sukayev, S. N. Fedorov, “On local affinity based method of solving systems of quadratic Boolean equations”, Inform. Primen., 13:2 (2019), 37–46
O. A. Logachev, A. A. Sukayev, S. N. Fedorov, “Polynomial algorithms for constructing local affinities of quadratic Boolean functions”, Inform. Primen., 13:1 (2019), 67–74
O. A. Logachev, S. N. Fedorov, V. V. Yashchenko, “On the $\Delta$-equivalence of Boolean functions”, Diskr. Mat., 30:4 (2018), 29–40; Discrete Math. Appl., 30:2 (2020), 93–101
O. A. Logachev, S. N. Fedorov, V. V. Yashchenko, “Boolean functions as points on the hypersphere in the Euclidean space”, Diskr. Mat., 30:1 (2018), 39–55; Discrete Math. Appl., 29:2 (2019), 89–101
O. A. Logachev, “An information based criterion for perfectly balanced functions”, Inform. Primen., 12:4 (2018), 70–74
8.
E. K. Alekseev, E. K. Karelina, O. A. Logachev, “On construction of correlation-immune functions via minimal functions”, Mat. Vopr. Kriptogr., 9:2 (2018), 7–22
O. A. Logachev, “On the local invertibility of finite state information lossless automata”, Prikl. Diskr. Mat., 2018, no. 39, 78–93
2017
10.
O. A. Logachev, “A criterion of perfect balance for shift-composition of functions over a finite alphabet”, Diskr. Mat., 29:4 (2017), 59–65; Discrete Math. Appl., 29:1 (2019), 1–5
2012
11.
O. A. Logachev, S. V. Smyshlyaev, V. V. Yashchenko, “On $\rho$-balanced Boolean functions”, Diskr. Mat., 24:2 (2012), 154–159; Discrete Math. Appl., 22:3 (2012), 345–352
O. A. Logachev, S. V. Smyshlyaev, V. V. Yashchenko, “New methods of investigation of perfectly balanced Boolean functions”, Diskr. Mat., 21:2 (2009), 51–74; Discrete Math. Appl., 19:3 (2009), 237–262
O. A. Logachev, “A lower bound for the affinity level for almost all Boolean functions”, Diskr. Mat., 20:4 (2008), 85–88; Discrete Math. Appl., 18:5 (2008), 553–556
M. L. Buryakov, O. A. Logachev, “On the affinity level of Boolean functions”, Diskr. Mat., 17:4 (2005), 98–107; Discrete Math. Appl., 15:5 (2005), 479–488
O. A. Logachev, A. A. Sal'nikov, V. V. Yashchenko, “On the inheritance of properties of Boolean functions under restrictions”, Diskr. Mat., 14:2 (2002), 9–19; Discrete Math. Appl., 12:3 (2002), 201–212
2001
17.
O. A. Logachev, A. A. Sal'nikov, V. V. Yashchenko, “Some characteristics of “nonlinearity” of group mappings”, Diskretn. Anal. Issled. Oper., Ser. 1, 8:1 (2001), 40–54
O. A. Logachev, A. A. Sal'nikov, V. V. Yashchenko, “On a property of associated representations of the group $\mathrm{GL}(n,k)$”, Diskr. Mat., 12:2 (2000), 154–159
1999
19.
O. A. Logachev, A. A. Sal'nikov, V. V. Yashchenko, “On properties of Weil sums over finite fields and finite abelian groups”, Diskr. Mat., 11:2 (1999), 66–85; Discrete Math. Appl., 9:3 (1999), 245–266
O. A. Logachev, A. A. Sal'nikov, V. V. Yashchenko, “Pairing of Finite Modules, Duality of Linear Codes, and the MacWilliams Identities”, Probl. Peredachi Inf., 34:3 (1998), 50–59; Problems Inform. Transmission, 34:3 (1998), 250–258
21.
O. A. Logachev, V. V. Yashchenko, “Codes of the Reed–Muller Type on a Finite Abelian Group”, Probl. Peredachi Inf., 34:2 (1998), 32–46; Problems Inform. Transmission, 34:2 (1998), 121–133
O. A. Logachev, A. A. Sal'nikov, V. V. Yashchenko, “On finite Abelian groups with nonsingular quadratic form”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 1998, no. 6, 3–6
1997
23.
O. A. Logachev, A. A. Sal'nikov, V. V. Yashchenko, “Bent functions on a finite abelian group”, Diskr. Mat., 9:4 (1997), 3–20; Discrete Math. Appl., 7:6 (1997), 547–564
O. A. Logachev, G. V. Proskurin, V. V. Yashchenko, “Local inversion of a finite automaton by means of automata”, Diskr. Mat., 7:2 (1995), 19–33; Discrete Math. Appl., 5:3 (1995), 203–216
Contact us: