A Novel Approach Towards Degree and Walsh-Transform of Boolean Functions
From MaRDI portal
Publication:6169937
DOI10.1142/S0129054122500101OpenAlexW4281493197MaRDI QIDQ6169937FDOQ6169937
Authors: Sunil Kumar, Harshdeep Singh, Gaurav Mittal 
Publication date: 15 August 2023
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054122500101
Recommendations
- Computing Walsh Transform from the Algebraic Normal Form of a Boolean Function
- Generic construction of Boolean functions with a few Walsh transform values of any possible algebraic degree
- Computing Walsh coefficients from the algebraic normal form of a Boolean function
- Arithmetic Walsh transform of quadratic Boolean functions. (Extended abstract)
- On the Walsh-Fourier analysis of Boolean functions
Boolean functionfinite fieldWalsh-Hadamard transformalgebraic normal formMöbius transformnumerical normal form
Cites Work
- A Mathematical Theory of Communication
- Title not available (Why is that?)
- Cryptographic Boolean functions and applications
- On the Degree, Nonlinearity, Algebraic Thickness, and Nonnormality of Boolean Functions, With Developments on Symmetric Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Boolean functions and their applications in cryptography
- Title not available (Why is that?)
- Fast Fourier transform and convolution algorithms
- Shift Register Sequences
- Boolean functions for cryptography and coding theory
- On the number of resilient Boolean functions
- A Novel Application of Boolean Functions With High Algebraic Immunity in Minimal Codes
Cited In (3)
This page was built for publication: A Novel Approach Towards Degree and Walsh-Transform of Boolean Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169937)
