Fix any generator matrix where the encoding of any nonzero message has fewer than zeroes. For any subset ,
if , then ,
if , then .
When , only can make all alphabets over being 0. Hence, , .
Let of size . We first have
By Rank-Nullity,
since the linear code alphabets over is iff 191919 or by as is the distance of the level linear code, which is no more than by MDS code. , then
hence , and . Again by Rank-Nullity,
and hence,
which completes the proof, that . ∎
TODO: basefold stuffs [CF24].