Asymptotic enumeration of correlation-immune Boolean functions

DOI10.1007/s12095-010-0019-xzbMath1218.05016arXiv0909.3321MaRDI QIDQ2380852

Brendan D. McKay, Catherine Greenhill, E. Rodney Canfield, Robert W. Robinson, Zhi-Cheng Gao

Publication date: 12 April 2010

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0909.3321

zbMATH Keywords

asymptotic enumeration; Boolean function; resilient; correlation-immune

Mathematics Subject Classification ID

05A16: Asymptotic enumeration

94C11: Switching theory, applications of Boolean algebras to circuits and networks

94D10: Boolean functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improving bounds for the number of correlation immune Boolean functions
• A note on the spectral characterization of correlation immune Boolean functions
• Balancing the \(n\)-cube: A census of colorings
• Enumerating Boolean functions of cryptographic significance
• Orthogonal arrays. Theory and applications
• Hamming weights of correlation immune Boolean functions
• Further enumerating Boolean functions of cryptographic significance
• Improved Asymptotic Formulas for Counting Correlation Immune Boolean Functions
• A spectral characterization of correlation-immune combining functions
• An Upper Bound on the Number of m-Resilient Boolean Functions
• A local limit theorem for the distribution of a part of the spectrum of a random binary function
• Enumeration of binary orthogonal arrays of strength 1