1 problem

Let $RM(r,m)$ be the binary Reed–Muller code of length $2^m$, and let $C=RM(r,m)$ with $3\le r\le m-2$. Let $\phi$ denote the Gray map from quaternary words to binary words. Reed–M…