Recursive Generation of a New Family of Constant Weight Block Codes

An algorithm is presented which allows code sets for constant weight binary block codes to be generated for block lengths and weights 2j-1. The distance properties of the code sets can be analytically determined. Codes with weight 2i-1 have a minimum Hamming distance of 2i. The paper gives a number of examples and demonstrates an application for the codes as symbols for m-ary communication systems which has superior noise performance than m-ary FSK for the same bandwidth efficiency.