Characterisation and enumeration of a class of semi bent quadratic Boolean functions

Date

2015-01-01

Author

KOÇAK, Neşe
Koçak, Onur Ozan
Özbudak, Ferruh
SAYGI, ZÜLFÜKAR

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

264
views

0
downloads

In this paper, we consider semi-bentness of quadratic Boolean functions defined for even n and give the characterisation of these functions. Up to our knowledge, semi-bentness of this class has not been investigated before and we proved that semi-bent functions of this form exist only for 6|n. Furthermore, we present a method for enumeration of semi-bent and bent functions in certain classes. Using this method we find the exact number of semi-bent functions of this form. Moreover, we complete some previous partial and incomplete enumeration results for three other classes of semi-bent/bent functions in the literature using this method. We also correct some results on quadratic bent functions stated in Ma et al. (2005).

Subject Keywords

Quadratic boolean functions, Semi-bent functions, Self-reciprocal polynomials, Enumeration, Bent functions

URI

https://hdl.handle.net/11511/42238

Journal

International Journal of Information and Coding Theory

DOI

https://doi.org/10.1504/ijicot.2015.068696

Collections

Department of Mathematics, Article

Suggestions

OpenMETU
Core

Generalized rotation symmetric and dihedral symmetric boolean functions - 9 variable boolean functions with nonlinearity 242 Kavut, Selcuk; Yucel, Melek Diker (2007-12-20) Recently, 9-variable Boolean functions having nonlinearity 241, which is strictly greater than the bent concatenation bound of 240, have been discovered in the class of Rotation Symmetric Boolean Functions (RSBFs) by Kavut, Maitra and Yucel. In this paper, we present several 9-variable Boolean functions having nonlinearity of 242, which we obtain by suitably generalizing the classes of RSBFs and Dihedral Symmetric Boolean Functions (DSBFs). These functions do not have any zero in the Walsh spectrum values, ...
Affine Equivalency and Nonlinearity Preserving Bijective Mappings over F-2 Sertkaya, Isa; Doğanaksoy, Ali; Uzunkol, Osmanbey; Kiraz, Mehmet Sabir (2014-09-28) We first give a proof of an isomorphism between the group of affine equivalent maps and the automorphism group of Sylvester Hadamard matrices. Secondly, we prove the existence of new nonlinearity preserving bijective mappings without explicit construction. Continuing the study of the group of nonlinearity preserving bijective mappings acting on n-variable Boolean functions, we further give the exact number of those mappings for n <= 6. Moreover, we observe that it is more beneficial to study the automorphis...
Finite bisimulations for switched linear systems Aydın Göl, Ebru; Lazar, Mircea; Belta, Calin (2013-02-04) In this paper, we consider the problem of constructing a finite bisimulation quotient for a discrete-time switched linear system in a bounded subset of its state space. Given a set of observations over polytopic subsets of the state space and a switched linear system with stable subsystems, the proposed algorithm generates the bisimulation quotient in a finite number of steps with the aid of sublevel sets of a polyhedral Lyapunov function. Starting from a sublevel set that includes the origin in its interio...
Finite Bisimulations for Switched Linear Systems Aydın Göl, Ebru; Lazar, Mircea; Belta, Calin (2014-12-01) In this paper, we consider the problem of constructing a finite bisimulation quotient for a discrete-time switched linear system in a bounded subset of its state space. Given a set of observations over polytopic subsets of the state space and a switched linear system with stable subsystems, the proposed algorithm generates the bisimulation quotient in a finite number of steps with the aid of sublevel sets of a polyhedral Lyapunov function. Starting from a sublevel set that includes the origin in its interio...
A New Combinatorial Identity for Catalan Numbers Aker, Kursat; Gursoy, Aysin Erkan (2017-10-01) In this article, we prove a conjecture about the equality of two generating functions described in "From Parking Functions to Gelfand Pairs (Aker, Can 2012)" attached to two sets whose cardinalities are given by Catalan numbers: We establish a combinatorial bijection between the two sets on which the two generating functions were based on.

Citation Formats

N. KOÇAK, O. O. Koçak, F. Özbudak, and Z. SAYGI, “Characterisation and enumeration of a class of semi bent quadratic Boolean functions,” International Journal of Information and Coding Theory, pp. 39–57, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/42238.