On those Boolean functions that are coset leaders of first order Reed-Muller codes
From MaRDI portal
Publication:6150957
DOI10.1007/s10472-023-09842-5OpenAlexW4366985329MaRDI QIDQ6150957
Publication date: 9 February 2024
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-023-09842-5
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Algebraic combinatorics (05E99) Boolean functions (94D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Basic theory in construction of Boolean functions with maximum possible annihilator immunity
- Four decades of research on bent functions
- On ``bent functions
- Fast evaluation, weights and nonlinearity of rotation-symmetric functions
- Proof of a conjecture about rotation symmetric functions
- Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts
- Boolean and Vectorial Plateaued Functions and APN Functions
- The Newton radius of codes
- A Complete Study of Two Classes of Boolean Functions: Direct Sums of Monomials and Threshold Functions
- Boolean Functions for Cryptography and Coding Theory
- Computing coset leaders and leader codewords of binary codes
- Bent Functions
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
This page was built for publication: On those Boolean functions that are coset leaders of first order Reed-Muller codes