scholarly journals Boolean functions, invariance groups and parallel complexity

2003 ◽  
Author(s):  
P. Clote ◽  
E. Kranakis
Keyword(s):  
Boolean Functions ◽  
Parallel Complexity ◽  
Invariance Groups

scholarly journals Boolean Functions, Invariance Groups, and Parallel Complexity

1991 ◽  
Vol 20 (3) ◽  
pp. 553-590 ◽  
Author(s):  
Peter Colte ◽  
Evangelos Kranakis
Keyword(s):  
Boolean Functions ◽  
Parallel Complexity ◽  
Invariance Groups

scholarly journals Invariance groups of functions and related Galois connections

2020 ◽  
Author(s):  
Eszter K. Horváth ◽  
Reinhard Pöschel ◽  
Sven Reichard
Keyword(s):  
Boolean Functions ◽  
Group Actions ◽  
Galois Connection ◽  
General Context ◽  
Abstract Group ◽  
Galois Connections ◽  
Invariance Groups ◽  
Galois Closures

Abstract Invariance groups of sets of Boolean functions can be characterized as Galois closures of a suitable Galois connection. We consider such groups in a much more general context using group actions of an abstract group and arbitrary functions instead of Boolean ones. We characterize the Galois closures for both sides of the corresponding Galois connection and apply the results to known group actions.

CLASS OF BOOLEAN FUNCTIONS CONSTRUCTED USING SIGNIFICANT BITS OF LINEAR RECURRENCES OVER THE RING ℤ2n

2019 ◽  
Vol 6 (2) ◽  
pp. 90-94
Author(s):  
Hernandez Piloto Daniel Humberto
Keyword(s):  
Linear Function ◽  
Boolean Functions ◽  
Hamming Distance ◽  
Linear Recurrences ◽  
Maximum Period ◽  
Non Linear ◽  
The Given ◽  
Class Of Functions

In this work a class of functions is studied, which are built with the help of significant bits sequences on the ring ℤ2n. This class is built with use of a function ψ: ℤ2n → ℤ2. In public literature there are works in which ψ is a linear function. Here we will use a non-linear ψ function for this set. It is known that the period of a polynomial F in the ring ℤ2n is equal to T(mod 2)2α, where α∈ , n01- . The polynomials for which it is true that T(F) = T(F mod 2), in other words α = 0, are called marked polynomials. For our class we are going to use a polynomial with a maximum period as the characteristic polyomial. In the present work we show the bounds of the given class: non-linearity, the weight of the functions, the Hamming distance between functions. The Hamming distance between these functions and functions of other known classes is also given.

On the Signal-to-Noise Ratio for Boolean Functions

2020 ◽  
Vol E103.A (12) ◽  
pp. 1659-1665
Author(s):  
Yu ZHOU ◽  
Wei ZHAO ◽  
Zhixiong CHEN ◽  
Weiqiong WANG ◽  
Xiaoni DU
Keyword(s):  
Boolean Functions ◽  
Signal To Noise Ratio ◽  
Signal To Noise ◽  
Noise Ratio
Sign in / Sign up

Export Citation Format

Share Document