Computing Walsh coefficients from the algebraic normal form of a Boolean function

DOI10.1007/s12095-014-0103-8zbMath1352.94098OpenAlexW1986378295MaRDI QIDQ458740

Wenling Wu, Xinxin Gong, Dengguo Feng, Bin Zhang

Publication date: 8 October 2014

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

Full work available at URL: https://doi.org/10.1007/s12095-014-0103-8

zbMATH Keywords

Boolean functionWalsh coefficientalgebraic normal formGupta-Sarkar's algorithm

Mathematics Subject Classification ID

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On ``bent functions
• Spectral domain analysis of correlation immune and resilient Boolean functions
• Computing the Weight of a Boolean Function from Its Algebraic Normal Form
• Linearity testing in characteristic two
• Constant depth circuits, Fourier transform, and learnability
• Computing Partial Walsh Transform From the Algebraic Normal Form of a Boolean Function

This page was built for publication: Computing Walsh coefficients from the algebraic normal form of a Boolean function