"A New Table of Constant Weight Codes" by A.E.Brouwer, N.J.A. Sloane, J.B.Shearer, and W.D. Smith, IEEE Transactions on Information Theory, IT-36(1990), p. 1334-1380.
Abstract: A table of binary constant weight codes of length n <= 28 is presented. Explicit constructions are given for most of the 600 codes in the table; the majority of these codes are new. The known techniques for constructing constant weight codes are surveyed, and also a table is given of (unrestricted) binary codes of length n <= 28.
(List compiled by J.B.Shearer.)
Abstract: Upper and lower bounds are presented for the maximal possible size of mixed binary/ternary error-correcting codes. A table up to length 13 is included. The upper bounds are obtained by applying the linear programming bound to the product of two association schemes. The lower bounds arise from a number of different constructions.