Enumerative encoding of correlation-immune Boolean functions
From MaRDI portal
Publication:386997
DOI10.1016/J.TCS.2013.02.026zbMATH Open1294.94037OpenAlexW2040339844MaRDI QIDQ386997FDOQ386997
Jean-Marie Le Bars, Alfredo Viola, Nicolás Carrasco
Publication date: 11 December 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.02.026
Boolean functionscorrelation-immune functions1-resilient functionsdecomposable structuresenumerative encodinguniform random generation
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph-Based Algorithms for Boolean Function Manipulation
- Further enumerating Boolean functions of cryptographic significance
- Improving bounds for the number of correlation immune Boolean functions
- Enumerating Boolean functions of cryptographic significance
- Enumerative source encoding
- A calculus for the random generation of labelled combinatorial structures
- Universal affine classification of Boolean functions
- Asymptotic enumeration of correlation-immune Boolean functions
- Construction of 1-resilient Boolean functions with optimal algebraic immunity and good non\-linearity
- Improved Asymptotic Formulas for Counting Correlation Immune Boolean Functions
- Equivalence Classes of Boolean Functions for First-Order Correlation
- Balancing the \(n\)-cube: A census of colorings
Cited In (2)
This page was built for publication: Enumerative encoding of correlation-immune Boolean functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q386997)
