Let \mathcal{C} be a q-ary code with block length n and minimum distance d. Generalize the previous problem to prove that, for t=\left\lfloor\frac{d-1}{2}\right\rfloor,
|\mathcal{C}| \leq \frac{q^{n}}{\sum_{i=0}^{t}\binom{n}{i}(q-1)^{i}}
Let \mathcal{C} be a q-ary code with block length n and minimum distance d. Generalize the previous problem to prove that, for t=\left\lfloor\frac{d-1}{2}\right\rfloor,