On -balanced Boolean functions.
From MaRDI portal
Publication:4917403
Recommendations
Cited in
(12)- On 1-stable perfectly balanced Boolean functions
- A criterion of perfect balance for shift-composition of functions over a finite alphabet
- Properties of proper families of Boolean functions
- Generalization of one method of a filter generator key recovery
- Counting Boolean functions with specified values in their Walsh spectrum
- One sufficient and necessary condition on balanced Boolean functions with \(\sigma_{f} = 2^{2n} + 2^{n+3}\) \((n \geq 3)\)
- Functions without short implicants. I: Lower estimates of weights
- Barriers of perfectly balanced Boolean functions
- Connections between some parameters of perfectly balanced Boolean functions
- FREQUENCY CHARACTERISTICS OF CYCLES IN OUTPUT SEQUENCES GENERATED BY COMBINING GENERATORS OVER THE FIELD OF TWO ELEMENTS
- THE NONLINEARITY INDEX FOR A PIECEWISE-LINEAR SUBSTITUTION OF THE ADDITIVE GROUP OF THE FIELD F2n
- From cryptanalysis to cryptographic property of a Boolean function
This page was built for publication: On \(\rho\)-balanced Boolean functions.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4917403)