Two methods of constructing binary constant-weight codes from 1) codes
over GF(q) and 2) constant-weight codes over GF(q) are presented. Sev
eral classes of binary optimum constant-weight codes are derived from
these methods. in general, we show that binary optimum constant-weight
codes, which achieve the Johnson bound, can be constructed from optim
um codes over CF(q) which achieve the Plotkin bound. Finally, several
classes of optimum constant-weight codes over GF(q) are constructed.