Maximum weight spectrum codes

In the recent work [ 9 ], a combinatorial problem concerning linear codes over a finite field \begin{document}$\mathbb{F}_q$\end{document} was introduced. In that work the authors studied the weight set of an \begin{document}$[n,k]_q$\end{document} linear code, that is the set of non-zero distinct Hamming weights, showing that its cardinality is bounded above by \begin{document}$\frac{q^k-1}{q-1}$\end{document} . They showed that this bound was sharp in the case \begin{document}$ q = 2 $\end{document} , and in the case \begin{document}$ k = 2 $\end{document} . They conjectured that the bound is sharp for every prime power \begin{document}$ q $\end{document} and every positive integer \begin{document}$ k $\end{document} . In this work we quickly establish the truth of this conjecture. We provide two proofs, each employing different construction techniques. The first relies on the geometric view of linear codes as systems of projective points. The second approach is purely algebraic. We establish some lower bounds on the length of codes that satisfy the conjecture, and the length of the new codes constructed here are discussed.