New constant weight codes are found by considering certain Linear perm
utation groups. A code is obtained as a collection of orbits of words
under such a group. This leads to a difficult optimization problem, wh
ere a stochastic search heuristic, tabu search, is used to find good s
olutions in a feasible amount of time. Nearly 40 new codes of length a
t most 28 are presented.