Abstract
A problem of polynomial expansion of symmetric Boolean functions is considered. A matrix method for polynomial expansion of symmetric functions that can be used to calculate the working numbers of homogeneous polynomial symmetric Boolean functions is proposed.
Similar content being viewed by others
References
Pospelov, D.A., Logicheskie metody analiza i sinteza skhem (Logical Methods of Scheme Analysis and Synthesis), Moscow: Energiya, 1974.
Sasao, T. and Besslich, Ph., On the Complexity of Mod-2 Sum PLA’s, IEEE Trans. Comput., 1990, vol. 39, pp. 262–266.
Sasao, T., Index Generation Functions: Recent Developments, Proc. Int. Symp. on Multiple-Valued Logic, Tuusula, 2011, pp. 1–9.
Rafiev I.A., Murphy, J.P. and Yakovlev, A., Quaternary Reed-Muller Expansions of Mixed Radix Arguments in Cryptographic Circuits, Proc. 39th Int. Symp. on Multiple-Valued Logic, Washington: IEEE Computer Society, 2009.
Suprun, V.P., Table Method of Boolean Function Polynomial Expansion, Kibernetika, 1987, no. 1, pp. 116–117.
Saluja, K.K. and Ong, E.H., Minimization of Reed-Muller Canonic Expansion, IEEE Trans. Comput., 1979, vol. 28, No 7, pp. 535–537.
Suprun, V.P., Transformation Method of d.n.f. Boolean Functions in Zhegalkin Canonical Polynomial, Avtomat. Vychisl. Tekhn., 1984, no. 2, pp. 78–81.
Suprun, V.P., Polynomial Expansion of Symmetric Boolean Functions, Izv. Akad. Nauk SSSR. Tekhn. Kibernetika, 1985, no. 4, pp. 123–127.
Author information
Authors and Affiliations
Corresponding author
Additional information
Original Russian Text © V.P. Suprun, D.A. Gorodecky, 2013, published in Avtomatika i Vychislitel’naya Tekhnika, 2013, No. 1, pp. 5–12.
About this article
Cite this article
Suprun, V.P., Gorodecky, D.A. Matrix method of polynomial expansion of symmetric Boolean functions. Aut. Control Comp. Sci. 47, 1–6 (2013). https://doi.org/10.3103/S0146411613010070
Received:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S0146411613010070