Applied numerical linear algebra
Applied numerical linear algebra
Edge local complementation and equivalence of binary linear codes
Designs, Codes and Cryptography
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Generalized Bent Criteria for Boolean Functions (I)
IEEE Transactions on Information Theory
Monomial bent functions and Stickelberger's theorem
Finite Fields and Their Applications
Parametrization of self-dual codes by orthogonal matrices
Finite Fields and Their Applications
Classification of self dual quadratic bent functions
Designs, Codes and Cryptography
Generalised complementary arrays
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
MacWilliams duality and a Gleason-type theorem on self-dual bent functions
Designs, Codes and Cryptography
On formally self-dual boolean functions in 2,4 and 6 variables
WAIFI'12 Proceedings of the 4th international conference on Arithmetic of Finite Fields
The selfnegadual properties of generalised quadratic Boolean functions
Designs, Codes and Cryptography
Hi-index | 0.00 |
A bent function is called self-dual if it is equal to its dual. It is called anti-self-dual if it is equal to the complement of its dual. A spectral characterisation in terms of the Rayleigh quotient of the Sylvester Hadamard matrix is derived. Bounds on the Rayleigh quotient are given for Boolean functions in an odd number of variables. An efficient search algorithm based on the spectrum of the Sylvester matrix is derived. Primary and secondary constructions are given. All self-dual bent Boolean functions in ≤ 6 variables and all quadratic such functions in eight variables are given, up to a restricted form of affine equivalence.