Answers are grounded in this paper and cite their sources.
Nonlinear cyclic codes are constructed which improve on published lower bounds for the numberA(n,d,w)of codewords in a binary code of lengthn, constant weightw, and minimum distanced.
No takes yet. Share an insight, caveat, or question.
Robert E. Kibler (1980) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: