Computing the Weight of a Boolean Function from Its Algebraic Normal Form

DOI10.1007/978-3-642-30615-0_8zbMATH Open1290.94169OpenAlexW165405363MaRDI QIDQ2907280FDOQ2907280

Authors: Çağdaş Çalık, Ali Doğanaksoy 

Publication date: 7 September 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-30615-0_8

Recommendations

• Computing Walsh coefficients from the algebraic normal form of a Boolean function
• Weight and nonlinearity of Boolean functions
• Recursive weights for some Boolean functions
• Computing Walsh Transform from the Algebraic Normal Form of a Boolean Function
• Computing Partial Walsh Transform From the Algebraic Normal Form of a Boolean Function
• Weights for short quartic Boolean functions
• Algorithms for Weighted Boolean Optimization
• scientific article; zbMATH DE number 4176983
• scientific article; zbMATH DE number 26594
• Fast computing the algebraic degree of Boolean functions

zbMATH Keywords

weightBoolean functionsalgebraic normal form

Mathematics Subject Classification ID

Cited In (3)

• Computing Walsh Transform from the Algebraic Normal Form of a Boolean Function
• On the computation of the Möbius transform
• Computing Walsh coefficients from the algebraic normal form of a Boolean function

This page was built for publication: Computing the Weight of a Boolean Function from Its Algebraic Normal Form

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2907280)