New Covering Radius of Reed–Muller Codes for<tex>t</tex>-Resilient Functions
From MaRDI portal
Publication:3547197
Recommendations
- scientific article; zbMATH DE number 2085196
- On the Covering Radii of Binary Reed–Muller Codes in the Set of Resilient Boolean Functions
- On the covering radius of Reed-Muller codes
- Further results on the covering radii of the Reed-Muller codes
- Some results on the covering radii of Reed-Muller codes
- On the Generalized Covering Radii of Reed-Muller Codes
- Improving the Upper Bounds on the Covering Radii of Binary Reed–Muller Codes
- Some inequalities about the covering radius of Reed-Muller codes
- Cryptography and Coding
- A new approach to the covering radius of codes
Cited in
(10)- Boolean functions: degree and support
- On the second-order nonlinearity of the hidden weighted bit function
- On the Covering Radii of Binary Reed–Muller Codes in the Set of Resilient Boolean Functions
- scientific article; zbMATH DE number 1740045 (Why is no real title available?)
- scientific article; zbMATH DE number 2085196 (Why is no real title available?)
- Construction of bent functions of 2kvariables from a basis of
- Cryptography and Coding
- Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions
- A construction of bent functions of \(n+2\) variables from a bent function of \(n\) variables and its cyclic shifts
- On the construction of new bent functions from the max-weight and min-weight functions of old bent functions
This page was built for publication: New Covering Radius of Reed–Muller Codes for<tex>$t$</tex>-Resilient Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547197)