Affine equivalence for rotation symmetric Boolean functions with p^k variables
From MaRDI portal
Publication:413557
DOI10.1016/J.FFA.2011.11.005zbMATH Open1275.94026OpenAlexW1983583936MaRDI QIDQ413557FDOQ413557
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
Cites Work
- Affine equivalence of cubic homogeneous rotation symmetric functions
- Fast Software Encryption
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (12)
- Counting equivalence classes for monomial rotation symmetric Boolean functions with prime dimension
- Affine equivalence for cubic rotation symmetric Boolean functions with \(n=pq\) variables
- Finding Hamming weights without looking at truth tables
- Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions
- Counting permutation equivalent degree six binary polynomials invariant under the cyclic group
- Equivalence classes for cubic rotation symmetric functions
- Permutation equivalence of cubic rotation symmetric Boolean functions
- Theory of 2-rotation symmetric cubic Boolean functions
- On the matrix of rotation symmetric Boolean functions
- Affine equivalence of monomial rotation symmetric Boolean functions: a Pólya's theorem approach
- Recursion orders for weights of Boolean cubic rotation symmetric functions
- Affine equivalence of quartic monomial rotation symmetric Boolean functions in prime power dimension
This page was built for publication: Affine equivalence for rotation symmetric Boolean functions with \(p^k\) variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413557)
