Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
On a recursive class of plateaued Boolean functions
-
A. O. Logachev
Veröffentlicht/Copyright:
7. Januar 2011
Abstract
We investigate properties of a class of plateaued Boolean functions with support of the spectrum defined by a recursive class of matrices. For such supports of the spectrum, we find a precise number of functions with a given support. We also show that the set of these functions is the equivalence class of a function with this support of spectrum with respect to the group of shifts.
Received: 2010-09-09
Published Online: 2011-01-07
Published in Print: 2010-December
© de Gruyter 2010
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Bounds for the number of Boolean functions admitting affine approximations of a given accuracy
- Identification of a binary Markov chain of order s with r partial connections subjected to additive distortions
- On conditional Internet graphs whose vertex degrees have no mathematical expectation
- An estimate of the probability of localisation of the diameter of a random scale-free graph
- On a recursive class of plateaued Boolean functions
- On the distribution of some characteristics of a quasimonotone mapping
- The expressibility problem in a lattice with closure operation
- An algorithm to restore a linear recurring sequence over the ring R = Zpn from a linear complication of its highest coordinate sequence
- The uniform id-decomposition of functions of many-valued logic over homogeneous functions
- The completeness problem in the function algebra of linear integer-coefficient polynomials
- Circuits for disjunction admitting short unitary diagnostic tests
- The group of automorphisms of the set of bent functions
- Complexity of multiplication in commutative group algebras over fields of prime characteristic
- The summation of Markov sequences on a finite abelian group
- The asymptotics of the number of repetition-free Boolean functions in the basis B1
Artikel in diesem Heft
- Bounds for the number of Boolean functions admitting affine approximations of a given accuracy
- Identification of a binary Markov chain of order s with r partial connections subjected to additive distortions
- On conditional Internet graphs whose vertex degrees have no mathematical expectation
- An estimate of the probability of localisation of the diameter of a random scale-free graph
- On a recursive class of plateaued Boolean functions
- On the distribution of some characteristics of a quasimonotone mapping
- The expressibility problem in a lattice with closure operation
- An algorithm to restore a linear recurring sequence over the ring R = Zpn from a linear complication of its highest coordinate sequence
- The uniform id-decomposition of functions of many-valued logic over homogeneous functions
- The completeness problem in the function algebra of linear integer-coefficient polynomials
- Circuits for disjunction admitting short unitary diagnostic tests
- The group of automorphisms of the set of bent functions
- Complexity of multiplication in commutative group algebras over fields of prime characteristic
- The summation of Markov sequences on a finite abelian group
- The asymptotics of the number of repetition-free Boolean functions in the basis B1
