On the Number of Affine Equivalence Classes of Boolean Functions

Abstract

Let $R(r,n)$ be the $r$th order Reed-Muller code of length $2^n$. The affine linear group $\text{AGL}(n,{\mathbb{F}}_2)$ acts naturally on $R(r,n)$. We derive two formulas concerning the number of orbits of this action: (i) an explicit formula for the number of AGL orbits of $R(n,n)$, and (ii) an asymptotic formula for the number of AGL orbits of $R(n,n)/R(1,n)$. The number of AGL orbits of $R(n,n)$ has been numerically computed by several authors for $n\le 10$; result (i) is a theoretic solution to the question. Result (ii) answers a question by MacWilliams and Sloane.

arXiv comment18 pages

References in corpus (1)

• Computing the Number of Equivalent Classes on $\mathcal{R}(s,n)/\mathcal{R}(k,n)$