Can you find value $A_q (n,n-1) $ code $C \subseteq F_q^n $ where $A_q(n,n-1)$ is the maximum number of words of length $n$, with minimum Hamming distance $n-1$.
I know if $n> \binom{q+1}{2}$ then $A_q (n,n-1) = q$. Can you give me a general result?!