Asymptotically optimal Boolean functions
From MaRDI portal
Publication:1734702
DOI10.1016/J.JCTA.2018.12.005zbMath1427.94120arXiv1711.08215OpenAlexW2964347103WikidataQ128777870 ScholiaQ128777870MaRDI QIDQ1734702
Publication date: 27 March 2019
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.08215
Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Boolean functions (94D10)
Related Items (3)
On nonlinearity of Boolean functions generated by the generalized Dobbertin construction ⋮ Modified Patterson-Wiedemann construction ⋮ Highly nonlinear functions over finite fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complete solving of explicit evaluation of Gauss sums in the index 2 case
- Calculation of certain Gauss sums
- 9-variable Boolean functions with nonlinearity 242 in the generalized rotation symmetric class
- On ``bent functions
- Nonlinearity and propagation characteristics of balanced Boolean functions
- Covering radius of the Reed-Muller code \(R(1,7)\) -- a simpler proof
- Six Standard Deviations Suffice
- The covering radius of the (128,8) Reed-Muller code is 56 (Corresp.)
- On the covering radius of binary codes (Corresp.)
- Modifications of Patterson-Wiedemann functions for cryptographic applications
- The covering radius of the<tex>(2^{15}, 16)</tex>Reed-Muller code is at least 16276
- Bent Functions
- Weight distributions of the cosets of the (32,6) Reed-Muller code
This page was built for publication: Asymptotically optimal Boolean functions
