Counting permutation equivalent degree six binary polynomials invariant under the cyclic group
From MaRDI portal
Publication:2397156
Recommendations
- Counting equivalence classes for monomial rotation symmetric Boolean functions with prime dimension
- On different families of invariant irreducible polynomials over \(\mathbb F_2\)
- Counting rotation symmetric functions using Polya's theorem
- Affine equivalence of monomial rotation symmetric Boolean functions: a Pólya's theorem approach
- Affine equivalence for rotation symmetric Boolean functions with \(p^k\) variables
Cites work
- Affine equivalence for rotation symmetric Boolean functions with \(2^{k }\) variables
- Affine equivalence for rotation symmetric Boolean functions with \(p^k\) variables
- Affine equivalence of cubic homogeneous rotation symmetric functions
- Affine equivalence of quartic homogeneous rotation symmetric Boolean functions
- Affine equivalence of quartic monomial rotation symmetric Boolean functions in prime power dimension
- Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions
- Counting equivalence classes for monomial rotation symmetric Boolean functions with prime dimension
- Irreducible Quartic Polynomials with Factorizations modulo p
- Isomorphism problem for a class of point-symmetric structures
- Note on a Quartic Congruence
- Rotation symmetric Boolean functions-count and cryptographic properties
This page was built for publication: Counting permutation equivalent degree six binary polynomials invariant under the cyclic group
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2397156)