1 problem

Let $C$ be a binary linear $[k+3,k]_2$ code, and let $M_2(k+3,k)$ denote the maximum possible number of minimal codewords among such codes. For $k\geq 4$, write … where the entries…