For even d, A_q(n,d,w) is asymptotically (q-1)^{t-1} binom(n,t)/binom(w,t) with t = w - d/2 + 1, matching the Johnson bound.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Asymptotically optimal constant weight codes with even distance
For even d, A_q(n,d,w) is asymptotically (q-1)^{t-1} binom(n,t)/binom(w,t) with t = w - d/2 + 1, matching the Johnson bound.