Determining the weight spectrum of the Reed–Muller codes $$RM(m-6,m)$$
Abstract
Translate Article 
Take Notes
Determining the weight spectrum of the Reed–Muller codes $$RM(m-6,m)$$
ReferencesShowing 8 of 8 papersConcatenations of the hidden weighted bit function and their cryptographic properties The Weight Spectrum of the Reed-Muller Codes RM(m – 5,m) The weight spectrum of two families of Reed-Muller codes Algebraic immunity for cryptographically significant Boolean functions: analysis and construction Weight congruences for p-ary cyclic codes On the weight enumeration of weights less than 2.5 d of Reed—Muller codes On the weight structure of Reed-Muller codes Classification of Boolean cubic forms of nine variables
8
- 10.3934/amc.2014.8.153
- Jan 1, 2014
- Advances in Mathematics of Communications
2
- 10.1109/tit.2023.3343697
- Jul 1, 2024
- IEEE Transactions on Information Theory
4
- 10.1016/j.disc.2023.113568
- Jun 20, 2023
- Discrete Mathematics
231
- 10.1109/tit.2006.876253
- Jul 1, 2006
- IEEE Transactions on Information Theory
81
- 10.1016/0012-365x(72)90032-5
- Jan 1, 1972
- Discrete Mathematics
83
- 10.1016/s0019-9958(76)90355-7
- Apr 1, 1976
- Information and Control
108
- 10.1109/tit.1970.1054545
- Nov 1, 1970
- IEEE Transactions on Information Theory
10
- 10.1109/itw.2003.1216724
- Aug 4, 2003
More from: Designs, Codes and CryptographyCorrection: Linearity of $$\mathbb {Z}_{2^L}$$-linear codes via Schur product Ryser’s theorem for simple multi-Latin rectangles Correction: On flag-transitive symmetric (v, k, 4) designs New constructions of cyclic constant-dimension subspace codes based on Sidon spaces and subspace polynomials Linearity of $$\mathbb {Z}_{2^L}$$-linear codes via Schur product More on the sum-freedom of the multiplicative inverse function Generalizing the Bierbrauer–Friedman bound for orthogonal arrays Determining the weight spectrum of the Reed–Muller codes $$RM(m-6,m)$$ Exploiting output bits and the $$\chi $$ operation in MitM preimage attacks on Keccak Galois LCD subspace codes
- Research Article
- 10.1007/s10623-025-01734-5
- Oct 4, 2025
- Designs, Codes and Cryptography
- Research Article
- 10.1007/s10623-025-01728-3
- Oct 2, 2025
- Designs, Codes and Cryptography
- Research Article
- 10.1007/s10623-025-01730-9
- Sep 28, 2025
- Designs, Codes and Cryptography
- Research Article
- 10.1007/s10623-025-01668-y
- Sep 19, 2025
- Designs, Codes and Cryptography
- Research Article
- 10.1007/s10623-025-01713-w
- Aug 31, 2025
- Designs, Codes and Cryptography
- Research Article
- 10.1007/s10623-025-01712-x
- Aug 14, 2025
- Designs, Codes and Cryptography
- Research Article
- 10.1007/s10623-025-01711-y
- Aug 13, 2025
- Designs, Codes and Cryptography
- Research Article
- 10.1007/s10623-025-01708-7
- Aug 8, 2025
- Designs, Codes and Cryptography
- Research Article
- 10.1007/s10623-025-01703-y
- Aug 7, 2025
- Designs, Codes and Cryptography
- Research Article
- 10.1007/s10623-025-01707-8
- Aug 7, 2025
- Designs, Codes and Cryptography
- Ask R Discovery
- Chat PDF
AI summaries and top papers from 250M+ research sources.