Answers are grounded in this paper and cite their sources.
Two methods of constructing binary constant-weight codes from (1) codes over GF(q) and (2) constant-weight codes over GF(q) are presented. Several classes of binary optimum constant-weight codes are derived from these methods. In general, we show that binary optimum constant-weight codes, which achieve the Johnson bound, can be constructed from optimum codes over GF(q) which achieve the Plotkin bound. Finally, several classes of optimum constant-weight codes over GF(q) are constructed.
No takes yet. Share an insight, caveat, or question.
Fu et al. (1998) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: