Maximum disjoint bases and constant-weight codes
Vladimir D. Tonchev · IEEE Transactions on Information Theory · 1998
The following lower bound for binary constant weight codes are derived by an explicit construction: A(17,4,5)/spl ges/441. The construction exploits maximal sets of bases in the four-dimensional binary vector space pairwise intersecting in at most two vectors.