Verifying the computed weight distribution for the binary Reed–Muller Code R(4,9)

Authors

  • Yuri Borissov Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, Bulgaria
  • Miroslav Markov Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, Bulgaria https://orcid.org/0000-0001-7882-2352

DOI:

https://doi.org/10.55630/mem.2026.55.340-349

Keywords:

binary Reed–Muller code, weight distribution, affine equivalence

Abstract

We revisit pivotal aspects of computing the weight distribution of the binary Reed– Muller code R(4, 9) and introduce a verification technique based on the Heninger– Rains–Sloane integrality congruences for Reed–Muller codes. The consistency checks fully confirm the correctness of the distribution obtained in our previous work: “The weight distribution of the fourth-order Reed–Muller code of length 512”, Designs, Codes and Cryptography 93, 2487–2502 (2025).

Author Biographies

Yuri Borissov, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, Bulgaria

Institute of Mathematics and Informatics
Bulgarian Academy of Sciences
Acad. G. Bonchev Str., Block 8
1113 Sofia, Bulgaria

Miroslav Markov, Institute of Mathematics and Informatics, Bulgarian Academy of Sciences, Sofia, Bulgaria

Institute of Mathematics and Informatics
Bulgarian Academy of Sciences
Acad. G. Bonchev Str., Block 8
1113 Sofia, Bulgaria

References

E. BERLEKAMP, F. J. MACWILLIAMS, and N. J. A. SLOANE. Gleason’s theorem on self-dual codes. IEEE Transactions on Information Theory, 18:409–414, 1972.

C. CARLET and P. SOLÉ. The weight spectrum of two families of Reed–Muller codes. Discrete Mathematics, 346(10):113568, 2023.

P. CHARPIN. Open problems on cyclic codes. In V. S. PLESS and C. W. HUFFMAN, editors, Handbook of Coding Theory, pages 963–1063. Elsevier, 1998.

T. W. CUSICK and Y. CHEON. Counting balanced boolean functions in n variables with bounded degree. Experimental Mathematics, 16(1):101–105, 2007.

V. GILLOT and PH. LANGEVIN. Classification of some cosets of the Reed–Muller code. Cryptography and Communications:10.1007/s12095–023–00652–4, 2023.

N. HENINGER, E. M. RAINS, and N. J. A. SLOANE. On the integrality of n-th roots of generating functions. Journal of Combinatorial Theory, Series A, 113:1732–1745, 2006.

T. KASAMI and N. TOKURA. On the weight structure of Reed–Muller codes. IEEE Transactions on Information Theory, 16:752–759, 1970.

PH. LANGEVIN. Classification of boolean quartic forms in eight variables, 2007. URL: https://langevin.univ-tln.fr/project/quartics.html.

PH. LANGEVIN. Classification of R(4, 7) /R(2, 7), 2012. URL: https://langevin.univ-tln.fr/project/rm742/rm742.html.

PH. LANGEVIN and G. LEANDER. Classification of boolean quartic forms in eight variables. In B. PRENEEL and O. A. LOGACHEV, editors, Boolean Functions in Cryptology and Information Security, pages 139–147. IOS Press, 2008.

F. J. MACWILLIAMS and N. J. A. SLOANE. The Theory of Error-Correcting Codes. North- Holland, Amsterdam, 1977.

M. MARKOV and Y. BORISSOV. The weight distribution of the fourth-order Reed–Muller code of length 512. Designs, Codes and Cryptography, 93:2487–2502, 2025.

OEIS FOUNDATION INC. The on-line encyclopedia of integer sequences. URL: https://oeis.org/. Last accessed 8 Jan. 2026.

D. V. SARWATE. Weight Enumeration of Reed–Muller Codes and Cosets. PhD thesis, Department of Electrical Engineering, Princeton University, Princeton NJ, 1973. Advisors: E. R. Berlekamp and J. D. Ullman.

N. J. A. SLOANE and E. R. BERLEKAMP. Weight enumerator for second-order Reed–Muller codes. IEEE Transactions on Information Theory, 16:745–751, 1970.

Downloads

Published

2026-05-19

How to Cite

[1]
Borissov, Y. and Markov, M. 2026. Verifying the computed weight distribution for the binary Reed–Muller Code R(4,9). Mathematics and Education in Mathematics. 55, (May 2026), 340–349. DOI:https://doi.org/10.55630/mem.2026.55.340-349.