Generic construction of Boolean functions with a few Walsh transform values of any possible algebraic degree
From MaRDI portal
Publication:6112189
DOI10.3934/amc.2022050zbMath1521.94141OpenAlexW4285204329MaRDI QIDQ6112189
Xiaoni Du, Zhixiong Chen, Wenling Wu, Wengang Jin
Publication date: 7 July 2023
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2022050
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Linear codes with two or three weights from quadratic bent functions
- On Dillon's class \(H\) of bent functions, Niho bent functions and o-polynomials
- A construction of hyperbent functions with polynomial trace form
- Binary sequences with optimal autocorrelation
- On ``bent functions
- Some results about the cross-correlation function between two maximal linear sequences
- Highly nonlinear mappings
- Several new infinite families of bent functions via second order derivatives
- Several classes of Boolean functions with few Walsh transform values
- A new class of monomial bent functions
- Linear Codes From Some 2-Designs
- Several New Infinite Families of Bent Functions and Their Duals
- Several New Classes of Bent Functions From Dillon Exponents
- Monomial bent functions
- Constructions of quadratic bent functions in polynomial forms
- Hyperbent Functions, Kloosterman Sums, and Dickson Polynomials
- Bent-function sequences
- On cryptographic properties of the cosets of R(1, m)
- Generic Construction of Bent Functions and Bent Idempotents With Any Possible Algebraic Degrees
- Cyclic Bent Functions and Their Applications in Sequences
- Bent Vectorial Functions, Codes and Designs
- More Balanced Boolean Functions With Optimal Algebraic Immunity and Good Nonlinearity and Resistance to Fast Algebraic Attacks
- Bent and Hyper-Bent Functions in Polynomial Form and Their Link With Some Exponential Sums and Dickson Polynomials
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
This page was built for publication: Generic construction of Boolean functions with a few Walsh transform values of any possible algebraic degree