On the Classification of Boolean Functions by the General Linear and Affine Groups
From MaRDI portal
Publication:5345029
Cited in
(18)- Equivalence of operations with respect to discriminator clones
- Cycle indices of linear, affine, and projective groups
- Computing the number of the equivalence classes for reversible logic functions
- The number of affine equivalent classes and extended affine equivalent classes of vectorial Boolean functions
- Classification of Boolean functions where affine functions are uniformly distributed
- On affine classification of permutations on the space \(\mathrm{GF}(2)^3\)
- Transparency order for Boolean functions: analysis and construction
- Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions
- On the number of classes of (n,k) switching networks
- Affine equivalency and nonlinearity preserving bijective mappings over \(\mathbb {F}_2\)
- Enumeration of reversible functions and its application to circuit complexity
- Bash-f: another LRX sponge function
- Affine equivalence of monomial rotation symmetric Boolean functions: a Pólya's theorem approach
- Equivalence classes of invertible Boolean functions
- Clones with finitely many relative \({\mathcal R}\)-classes
- An Algorithm for Linear, Affine and Spectral Classification of Boolean Functions
- Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms
- On a method of synthesis of correlation-immune Boolean functions
This page was built for publication: On the Classification of Boolean Functions by the General Linear and Affine Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5345029)
