  A family of $\omega$-circulant balanced weighing matrices with classical
parameters is used for the construction of optimal constant weight codes over
an alphabet of size $g+1$ and length $n=(q^m -1)/(q-1)$, where $q$ is an odd
prime power, $m>1$, and $g$ is a divisor of $q-1$.
