Counting rotation symmetric functions using Polya's theorem

DOI10.1016/j.dam.2013.12.016zbMath1288.05293OpenAlexW2035968489MaRDI QIDQ2449067

K. V. Lakshmy, M. Sethumadhavan, Thomas W. Cusick

Publication date: 6 May 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.12.016

zbMATH Keywords

homogeneous functionsrotation symmetric Boolean functionsbalanced functionsPolya's enumeration theorem

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Cryptography (94A60) Boolean functions (06E30)

Related Items (2)

Affine equivalence of monomial rotation symmetric Boolean functions: a Pólya's theorem approach ⋮ Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions

Cites Work

• Unnamed Item
• Affine equivalence of cubic homogeneous rotation symmetric functions
• On the number of rotation symmetric functions over \(\mathrm{GF}(p)\)
• Rotation symmetric Boolean functions-count and cryptographic properties
• Fast evaluation, weights and nonlinearity of rotation-symmetric functions
• Results on rotation symmetric polynomials over \(GF(p)\)
• On the number of rotation symmetric Boolean functions
• Enumeration of 9-Variable Rotation Symmetric Boolean Functions Having Nonlinearity > 240
• Enumeration of Homogeneous Rotation Symmetric Functions over F p
• Fast Software Encryption

This page was built for publication: Counting rotation symmetric functions using Polya's theorem