Universal affine classification of Boolean functions
From MaRDI portal
Recommendations
Cited in
(15)- Universal functions for classes of bilinear and polylinear Boolean functions
- On the classification of Boolean functions.
- Boolean functions: degree and support
- Equivalence classes of invertible Boolean functions
- Affine equivalency and nonlinearity preserving bijective mappings over \(\mathbb {F}_2\)
- Function representation of the Boolean-valued universe
- Classification of Boolean functions where affine functions are uniformly distributed
- Classification of Boolean functions by the invariants of their matrix representation
- The classification of reversible bit operations
- Function representation of the Boolean-valued universe
- scientific article; zbMATH DE number 3912285 (Why is no real title available?)
- Lower and upper bounds for the affinity order of transformations of Boolean vector spaces
- Enumerative encoding of correlation-immune Boolean functions
- Universal Perceptron Theory on Decomposition Structures of n-Bit Boolean Functions
- Maximal groups of invariant transformations of multiaffine, bijunctive, weakly positive, and weakly negative Boolean functions
This page was built for publication: Universal affine classification of Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1355863)