Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
On some algebraic and combinatorial properties of correlation-immune Boolean functions
-
E. K. Alekseev
Veröffentlicht/Copyright:
18. Oktober 2010
Abstract
The paper is devoted to the investigation of properties of correlation-immune and stable functions as a whole. The description of these properties is realised with the use of algebraic notions and operations.
Received: 2009-01-23
Published Online: 2010-10-18
Published in Print: 2010-October
© de Gruyter 2010
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Calculation of limit probabilities of the distribution of permanent of a random matrix over the field GF(p)
- On the number of coincidences of two homogeneous random walks with positive increments
- Plane sections of the generalised Pascal pyramid and their interpretations
- On proper colourings of hypergraphs using prescribed colours
- On large distances between neighbouring zeros of the Riemann zeta-function
- On some algebraic and combinatorial properties of correlation-immune Boolean functions
- Synthesis of easily testable circuits over the Zhegalkin basis in the case of constant faults of type 0 at outputs of elements
- A complete solution of the minimisation problem for a set of binary two-tape automata
Artikel in diesem Heft
- Calculation of limit probabilities of the distribution of permanent of a random matrix over the field GF(p)
- On the number of coincidences of two homogeneous random walks with positive increments
- Plane sections of the generalised Pascal pyramid and their interpretations
- On proper colourings of hypergraphs using prescribed colours
- On large distances between neighbouring zeros of the Riemann zeta-function
- On some algebraic and combinatorial properties of correlation-immune Boolean functions
- Synthesis of easily testable circuits over the Zhegalkin basis in the case of constant faults of type 0 at outputs of elements
- A complete solution of the minimisation problem for a set of binary two-tape automata
