Zhegalkin Polynomial of a Multiary Sole Sufficient Operator

— Sole sufficient operators are of particular interest among functionally complete sets of Boolean functions. They have a wide range of applicability and are not limited to the binarity case. In this paper, we formulate conditions imposed on the Zhegalkin polynomial coefficients that are necessary a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Automatic control and computer sciences Ročník 58; číslo 7; s. 808 - 826
Hlavní autoři: Bystrov, L. Y., Kuzmin, E. V.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Moscow Pleiades Publishing 01.12.2024
Springer Nature B.V
Témata:
Boolean
Boolean functions
Codes
Computer Science
Control Structures and Microprogramming
Operators (mathematics)
Polynomials
Variables
dual remainder polynomial
constant-preserving Boolean functions
self-dual Boolean functions
Zhegalkin polynomial
leading coefficient
sole sufficient operator
Sheffer function
precomplete classes
ISSN:0146-4116, 1558-108X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:— Sole sufficient operators are of particular interest among functionally complete sets of Boolean functions. They have a wide range of applicability and are not limited to the binarity case. In this paper, we formulate conditions imposed on the Zhegalkin polynomial coefficients that are necessary and sufficient for the polynomial to correspond to a sole sufficient operator. The polynomial representation of constant-preserving Boolean functions is considered. It is shown that the properties of monotonicity and linearity do not need to be specifically considered when describing a sole sufficient operator. The concept of a dual remainder polynomial is introduced; the value of it allows one to determine the self-duality of a Boolean function. It is proven that a Boolean function preserving 0 and 1 or preserving neither 0 nor 1 is self-dual if and only if the dual remainder of the corresponding Zhegalkin polynomial is 0 for any sets of values of the function variables. The system of leading coefficients is obtained based on this fact. The solution of the system makes it possible to formulate a criterion for the self-duality of a Boolean function represented by a Zhegalkin polynomial, which imposes necessary and sufficient conditions on the polynomial coefficients. Thus, it is shown that Zhegalkin polynomials are a rather convenient tool for studying precomplete classes of Boolean functions.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0146-4116
1558-108X
DOI:10.3103/S0146411624700275