Title :
Maximum disjoint bases and constant-weight codes
Author :
Tonchev, Vladimir D.
Author_Institution :
Dept. of Math. Sci., Michigan Technol. Univ., Houghton, MI, USA
fDate :
1/1/1998 12:00:00 AM
Abstract :
The following lower bound for binary constant weight codes are derived by an explicit construction: A(17,4,5)⩾441. The construction exploits maximal sets of bases in the four-dimensional binary vector space pairwise intersecting in at most two vectors
Keywords :
binary sequences; codes; Steiner system; binary constant weight codes; code construction; four-dimensional binary vector space; lower bound; maximum disjoint bases; Concatenated codes; Error correction; Error correction codes; Geometry; Printing; Size control; Upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
