Work on constant weight codes with n>28 was reported in :
D.H. Smith, L.A. Hughes and S. Perkins, A New Table of Constant Weight Codes of Length Greater than 28, The Electronic Journal of Combinatorics, Vol. 13, No. 1, (May 2006), #A2.
Montemanni at IDSIA and Smith at South Wales have collaborated to develop new algorithmic approaches for finding good constant weight codes. Many improved codes have been found for cases with 29<=n<=63, 5<=w<=8, 6<=d<=14 with d=2w-2, d=2w-4 and d=2w-6. Ten new optimal codes are included. Files of codewords can be found in the zip archive:
Note that two slightly different formats are in use.
Files of codewords are also available at IDSIA:
new_constant_weight_codes (zipped) at IDSIA.
This work has appeared in:
R. Montemanni and D.H. Smith, Heuristic Algorithms for Constructing Binary Constant Weight Codes,
IEEE Transactions on Information Theory, 55(10):4651-4656, 2009
Results in these two papers have been incorporated in (or superseded by results in) the table maintained by Andries Brouwer at:
Further improvements to the table of constant weight codes have been made in a paper:
Derek H. Smith and Roberto Montemanni, Some constant weight codes from primitive permutation groups, The Electronic Journal of Combinatorics, 19(4), (2012), #P4 (ISSN: 1077-8926)
Codeword files can be found in the zip archive