New constructions of optimal cyclically permutable constant weight codes

Three new constructions for families of cyclic constant weight codes are presented. All are asymptotically optimum in the sense that in each case, as the length of the sequences within the family approaches infinity, the ratio of family size to the maximum possible under the Johnson upper bound, approaches unity. >