Answers are grounded in this paper and cite their sources.
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.>
No takes yet. Share an insight, caveat, or question.
Moreno et al. (1995) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: