On design-theoretic aspects of Boolean and vectorial bent functions

03/27/2020
by   Alexandr Polujan, et al.
0

There are two construction methods of designs from Boolean and vectorial bent functions, known as translation and addition designs. In this paper we analyze, which equivalence relation for Boolean and vectorial bent functions is coarser: extended-affine equivalence or isomorphism of associated translation and addition designs. First, we observe that similar to the Boolean bent functions, extended-affine equivalence of vectorial bent functions and isomorphism of addition designs are the same concepts. Further, we show that extended-affine inequivalent Boolean bent functions in n variables, whose translation designs are isomorphic exist for all n>6. This implies, that isomorphism of translation designs for Boolean bent functions is a coarser equivalence relation than extended-affine equivalence. However, we do not observe the same phenomena for vectorial bent functions in a small number of variables. We classify and enumerate all vectorial bent functions in six variables and show, that in contrast to the Boolean case, one cannot exhibit isomorphic translation designs from extended-affine inequivalent vectorial bent functions in six variables.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/24/2019

Computing the Number of Affine Equivalence Classes of Boolean Functions modulo Functions of Different Degrees

Affine equivalence classes of Boolean functions has many applications in...
research
02/26/2021

Recovering or Testing Extended-Affine Equivalence

Extended Affine (EA) equivalence is the equivalence relation between two...
research
09/19/2023

Computing the Weight Distribution of the Binary Reed-Muller Code ℛ (4,9)

We compute the weight distribution of the ℛ (4,9) by combining the appro...
research
09/08/2022

Quasi-Random Influences of Boolean Functions

We examine a hierarchy of equivalence classes of quasi-random properties...
research
07/24/2020

On the Number of Affine Equivalence Classes of Boolean Functions

Let R(r,n) be the rth order Reed-Muller code of length 2^n. The affine l...
research
08/18/2023

Noise Sensitivity and Stability of Deep Neural Networks for Binary Classification

A first step is taken towards understanding often observed non-robustnes...
research
06/25/2021

Reducing Boolean Networks with Backward Boolean Equivalence

Boolean Networks (BNs) are established models to qualitatively describe ...

Please sign up or login with your details

Forgot password? Click here to reset