Upper bounds for doubly-constant-weight codes

These tables give the best known upper bounds on T(w1,n1,w2,n2,d) for all parameters such that n1+n2 is no greater than 28 and all even d up to 14, except in trivial cases where the exact values of T(w1,n1,w2,n2,d) are known; see [1, Theorem 32]. Also, the tables do not include bounds for n1 > n2, w1 > n1/2, or w2 > n2/2. All of these cases can be transformed into an equivalent bound in the tables through repeated application of the rules T(w1,n1,w2,n2,d) = T(w2,n2,w1,n1,d) and T(w1,n1,w2,n2,d) = T(n1-w1,n1,w2,n2,d).

The tables are organized according to the minimum distance: d=4, d=6, d=8, d=10, d=12, and d=14. Their disposition follows that of the previously best known tables, in [3], for d=10. Superscripts denote the theorem number in [1] by which the upper bounds were obtained. Please report updates or corrections.