Automata, Languages and Programming
From MaRDI portal
Publication:5716785
DOI10.1007/11523468zbMath1082.94011OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716785
Svetla Nikova, An Braeken, Yuri L. Borissov, Bart Preneel
Publication date: 10 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11523468
Related Items (17)
Analysis of affinely equivalent Boolean functions ⋮ On affine (non)equivalence of Boolean functions ⋮ Advances on Random Sequence Generation by Uniform Cellular Automata ⋮ The Multiplicative Complexity of Boolean Functions on Four and Five Variables ⋮ Affine Equivalency and Nonlinearity Preserving Bijective Mappings over $$\mathbb {F}_2$$ ⋮ A construction of bent functions of \(n+2\) variables from a bent function of \(n\) variables and its cyclic shifts ⋮ Affine equivalence for rotation symmetric Boolean functions with \(p^k\) variables ⋮ On the construction of new bent functions from the max-weight and min-weight functions of old bent functions ⋮ Four decades of research on bent functions ⋮ Classification of Boolean functions where affine functions are uniformly distributed ⋮ The multiplicative complexity of 6-variable Boolean functions ⋮ Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions ⋮ Boolean functions with multiplicative complexity 3 and 4 ⋮ Computing the number of affine equivalent classes on \(\mathcal{R}(s,n)/\mathcal{R}(k,n)\) ⋮ A group algebraic approach to NPN classification of Boolean functions ⋮ Unnamed Item ⋮ On a method of synthesis of correlation-immune Boolean functions
This page was built for publication: Automata, Languages and Programming
