Abstract
We describe the shortest representation of quadratic boolean functions as disiunctions of products of linear forms.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
Yu. I. Zhuravlev, “Set-theoretical methods of boolean algebra,” Probl. Kiber., No. 8, 5–44 (1962).
S. V. Yablonskii and O. B. Lupanov (eds.), Discrete Mathematics and Mathematical Topics in Cybernetics [in Russian], Vol. I, Nauka, Moscow (1974).
G. N. Povarov, “Mathematical theory of the design of contact (1, k)-poles,” Dokl. Akad. Nauk SSSR,100, No. 5, 909–912 (1955).
I. É. Strazdin', “Affine classification of boolean functions of five variables,” Avtomat. Vychisl. Tekh., No. 1, 1–9 (1975).
M. A. Harrison, “On the classification of Boolean functions by the general linear and affine groups,” J. SIAM,12, No. 2, 110–112 (1964).
L. E. Dickson, Linear Groups with an Exposition of the Galois Field Theory, Leipzig (1901).
A. A. Albert, “Symmetric and alternating matrices in an arbitrary field,” Trans. AMS,43, 386–436 (1938).
T. Kasami and N. Tokura, “On the weight structure of Reed-Muller codes,” IEEE Trans. Inf. Theory,16, 752–759 (1970).
Additional information
Translated from Kibernetika, No. 1, pp. 9–14, 18, January–February, 1989.
Rights and permissions
About this article
Cite this article
Aleksanyan, A.F. On realization of quadratic boolean functions by systems of linear equations. Cybern Syst Anal 25, 9–17 (1989). https://doi.org/10.1007/BF01074878
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01074878