Affine equivalence for rotation symmetric Boolean functions with \(p^k\) variables
From MaRDI portal
Publication:413557
DOI10.1016/j.ffa.2011.11.005zbMath1275.94026OpenAlexW1983583936MaRDI QIDQ413557
Alyssa Brown, Thomas W. Cusick
Publication date: 7 May 2012
Published in: Finite Fields and their Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ffa.2011.11.005
Related Items (10)
Counting equivalence classes for monomial rotation symmetric Boolean functions with prime dimension ⋮ Finding Hamming weights without looking at truth tables ⋮ Equivalence classes for cubic rotation symmetric functions ⋮ Counting permutation equivalent degree six binary polynomials invariant under the cyclic group ⋮ Affine equivalence for cubic rotation symmetric Boolean functions with \(n=pq\) variables ⋮ Affine equivalence of quartic monomial rotation symmetric Boolean functions in prime power dimension ⋮ Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions ⋮ Recursion orders for weights of Boolean cubic rotation symmetric functions ⋮ Permutation equivalence of cubic rotation symmetric Boolean functions ⋮ Theory of 2-rotation symmetric cubic Boolean functions
Cites Work
- Affine equivalence of cubic homogeneous rotation symmetric functions
- Affine equivalence for rotation symmetric Boolean functions with \(2^{k }\) variables
- On the weight and nonlinearity of homogeneous rotation symmetric Boolean functions of degree 2
- Automata, Languages and Programming
- Fast Software Encryption
- Unnamed Item
- Unnamed Item
This page was built for publication: Affine equivalence for rotation symmetric Boolean functions with \(p^k\) variables