Title: New Constant Weight Codes from Linear Permutation Groups

Journal: IEEE Transactions on Information Theory 43 (1997), 1623-1630

New constant weight codes are found by considering certain linear permutation groups. A code is obtained as a collection of orbits of words under such a group. This leads to a difficult optimization problem, where a stochastic search heuristic, tabu search, is used to find good solutions in a feasible amount of time. Nearly 40 new codes of length at most 28 are presented.