On the covering radius of R(1, m) in R(3, m)
From MaRDI portal
Publication:4887089
DOI10.1109/18.490572zbMATH Open0857.94025OpenAlexW2166436108MaRDI QIDQ4887089FDOQ4887089
Publication date: 31 July 1996
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.490572
Cyclic codes (94B15) Bounds on codes (94B65) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Cited In (6)
- Covering radius of RM(1,9) in RM(3,9)
- The covering radius of the Reed-Muller code \(\text{RM}(2, 7)\) is \(40\)
- A trigonometric sum sharp estimate and new bounds on the nonlinearity of some cryptographic Boolean functions
- New constructions of resilient and correlation immune Boolean functions achieving upper bound on nonlinearity
- On the covering radius of the third order Reed-Muller code \(\mathrm{RM}(3, 7)\)
- Exact 2-divisibility of exponential sums associated to Boolean functions
This page was built for publication: On the covering radius of R(1, m) in R(3, m)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887089)
