Title

Maximum disjoint bases and constant-weight codes

Authors

Vladimir Tonchev, Michigan Technological UniversityFollow

Document Type

Article

Publication Date

1-1998

Abstract

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.

Publisher's Statement

Copyright 1998. IEEE. Publisher’s version of record: https://dx.doi.org/10.1109/18.651061

Publication Title

IEEE Transactions on Information Theory

Recommended Citation

Tonchev, V. (1998). Maximum disjoint bases and constant-weight codes. IEEE Transactions on Information Theory, 44(1), 333-334. http://doi.org/10.1109/18.651061
Retrieved from: https://digitalcommons.mtu.edu/math-fp/146