New Methods in Finding Binary Constant Weight Codes

Abstract: This thesis presents new methods for finding optimal and near-optimal constant weight binary codes with distance d and weight w such that d=2(w-1). These methods have led to the discovery of a number of new codes which are being submitted for publication. Improvements in methods for generating lexicographic codes are also discussed, with suggestions for further research in this area.