Some new lower bounds are given for A(n,4,w), the maximum number of codewords in a binary code of length n, minimum distance 4, and constant weight w. In a number of cases the results significantly improve on the best bounds previously known.>
No takes yet. Share an insight, caveat, or question.
Pul et al. (1989) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: