Pages that link to "Item:Q5716785"

The following pages link to Automata, Languages and Programming (Q5716785):

Displaying 19 items.

• Affine equivalence for rotation symmetric Boolean functions with \(p^k\) variables (Q413557) (← links)
• On a method of synthesis of correlation-immune Boolean functions (Q783096) (← links)
• A construction of bent functions of \(n+2\) variables from a bent function of \(n\) variables and its cyclic shifts (Q895958) (← links)
• On the construction of new bent functions from the max-weight and min-weight functions of old bent functions (Q905066) (← links)
• Four decades of research on bent functions (Q908040) (← links)
• The multiplicative complexity of 6-variable Boolean functions (Q1755188) (← links)
• Boolean functions with multiplicative complexity 3 and 4 (Q2040305) (← links)
• Computing the number of affine equivalent classes on \(\mathcal{R}(s,n)/\mathcal{R}(k,n)\) (Q2048215) (← links)
• Classification of Boolean functions where affine functions are uniformly distributed (Q2249924) (← links)
• A group algebraic approach to NPN classification of Boolean functions (Q2322710) (← links)
• Analysis of affinely equivalent Boolean functions (Q2385399) (← links)
• On affine (non)equivalence of Boolean functions (Q2390953) (← links)
• Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions (Q2515558) (← links)
• Advances on Random Sequence Generation by Uniform Cellular Automata (Q2944879) (← links)
• The Multiplicative Complexity of Boolean Functions on Four and Five Variables (Q2946971) (← links)
• Affine Equivalency and Nonlinearity Preserving Bijective Mappings over $$\mathbb {F}_2$$ (Q2949476) (← links)
• On a new classification of Boolean functions (Q3383077) (← links)
• (Q5144374) (← links)
• Insights gained after a decade of cellular automata-based cryptography (Q6637836) (← links)