1 problem

Let $m\geq 4$ be even. Consider binary codes of length $2^m$ with size $2^{2^m-2m}$ and dual distance $2^{m-1}-2^{m/2-1}$; equivalently, let $F^*(n,2,t)$ denote the minimum size of…