We compute the weight distribution of the binary Reed–Muller code \({\mathcal {R}} (4,9)\) by combining the methodology described in D. V. Sarwate’s Ph.D. thesis from 1973 with newer results on the affine equivalence classification of Boolean functions. More specifically, to address this problem posed, e.g., in the book of MacWilliams and Sloane, we apply an enhanced approach based on the classification of Boolean quartic forms in eight variables due to Ph. Langevin and G. Leander, and the recent results on classification of the quotient space \({\mathcal {R}} (4,7)/{\mathcal {R}} (2,7)\) obtained by V. Gillot and Ph. Langevin.
