Counting rotation symmetric functions using Polya's theorem
From MaRDI portal
Publication:2449067
Recommendations
- On the number of rotation symmetric functions over \(\mathrm{GF}(p)\)
- Results on rotation symmetric polynomials over \(GF(p)\)
- Enumeration of Homogeneous Rotation Symmetric Functions over F p
- Enumeration of balanced symmetric functions over GF(p)
- Rotation symmetric Boolean functions-count and cryptographic properties
Cites work
- Affine equivalence of cubic homogeneous rotation symmetric functions
- Cryptographic Boolean functions and applications.
- Enumeration of 9-Variable Rotation Symmetric Boolean Functions Having Nonlinearity > 240
- Enumeration of Homogeneous Rotation Symmetric Functions over F p
- Fast Software Encryption
- Fast evaluation, weights and nonlinearity of rotation-symmetric functions
- On the number of rotation symmetric Boolean functions
- On the number of rotation symmetric functions over \(\mathrm{GF}(p)\)
- Results on rotation symmetric polynomials over \(GF(p)\)
- Rotation symmetric Boolean functions-count and cryptographic properties
Cited in
(11)- Results on permutation symmetric Boolean functions
- Counting with symmetric functions
- Counting strings over \(\mathbb Z2^d\) with given elementary symmetric function evaluations
- Enumerations of rotation polynomial on residue class ring
- On the number of rotation symmetric functions over \(\mathrm{GF}(p)\)
- Enumeration of Homogeneous Rotation Symmetric Functions over F p
- Construction and enumeration of balanced rotation symmetric Boolean functions
- Results on rotation symmetric polynomials over \(GF(p)\)
- Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions
- Counting permutation equivalent degree six binary polynomials invariant under the cyclic group
- Affine equivalence of monomial rotation symmetric Boolean functions: a Pólya's theorem approach
This page was built for publication: Counting rotation symmetric functions using Polya's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2449067)