103,059 research outputs found
Metrical properties of the set of bent functions in view of duality
In the paper, we give a review of metrical properties of the entire set of bent functions and its significant subclasses of self-dual and anti-self-dual bent functions. We present results for iterative construction of bent functions in n + 2 variables based on the concatenation of four bent functions and consider related open problem proposed by one of the authors. Criterion of self-duality of such functions is discussed. It is explored that the pair of sets of bent functions and affine functions as well as a pair of sets of self-dual and anti-self-dual bent functions in n > 4 variables is a pair of mutually maximally distant sets that implies metrical duality. Groups of automorphisms of the sets of bent functions and (anti-)self-dual bent functions are discussed. The solution to the problem of preserving bentness and the Hamming distance between bent function and its dual within automorphisms of the set of all Boolean functions in n variables is considered
Some results on -ary bent functions
Kumar et al.(1985) have extended the
notion of classical bent Boolean functions in the generalized setup
on \BBZ_q^n. They have provided an analogue of classical
Maiorana-McFarland type bent functions. In this paper, we study the
crosscorrelation of a subclass of such generalized
Maiorana-McFarland (\mbox{GMMF}) type bent functions. We provide a
construction of quaternary () bent functions on
variables in terms of their subfunctions on -variables. Analogues
of sum-of-squares indicator and absolute indicator of
crosscorrelation of Boolean functions are defined in the generalized
setup. Further, -ary functions are studied in terms of these
indictors and some upper bounds of these indicators are obtained.
Finally, we provide some constructions of balanced quaternary
functions with high nonlinearity under Lee metric
A STUDY OF BINARY DECISION DIAGRAM CHARACTERISTICS OF BENT BOOLEAN FUNCTIONS
Bent Boolean functions exist only for an even number of variables, moreover, they are unbalanced. Therefore, they are used in coding theory and in many areas of computer science. General form of bent functions is still unknown. One way of representing Boolean functions is with a reduced ordered binary decision diagram (ROBDD). The strength of ROBDDs is that they can represent Boolean functions data with a high level of redundancy in a compact form, as long as the data is encoded in such a way that the redundancy is exposed. This paper investigates characteristics of bent functions with focus on their ROBDD parameters. Decision diagram experimental framework has been used for implementation of a program for calculation of the ROBDD parameters. The results presented in this paper are intended to be used to create methods for the construction of bent functions using a ROBDD as a data structure from which the bent functions can be discovered
- …