This is the authors' abstract. We don't add key points for this paper.
LetA(n,2δ,w)denote the maximum number of codewords in any binary code of lengthn, constant weightw, and Hamming distance2 lower bounds forA(n,2δ,w)are given. Forwand,A(n,2δ,w) ≥ nW-δ+l/w!andA(n,4,w)~ nʷ⁻ˡ/w!asn → ∞. In most cases these are better than the "Gilbert bound." Revised tables ofA(n,2 δ,w)are given in the rangen ≤ 24andδ ≤ 5.
Answers are grounded in this paper and cite their sources.
No takes yet. Share an insight, caveat, or question.
Graham et al. (1980) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: