Title :
On the Upper Bound of the Size of the R-Cover-Free Families
Author :
Ruszinkó, Miklós
Author_Institution :
The notion of the r-cover-free families was introduced by Kautz and Singleton in 1964 [17]. They initiated investigating binary codes with the property that the disjunction of any /spl les/r (r /spl ges/ 2) codewords are distinct (UD/sub r/ codes). This l
Keywords :
Artificial intelligence; Binary codes; Bismuth; Combinatorial mathematics; H infinity control; Informatics; Information theory; Size control; Testing; Upper bound;
Conference_Titel :
Information Theory, 1993. Proceedings. 1993 IEEE International Symposium on
Print_ISBN :
0-7803-0878-6
DOI :
10.1109/ISIT.1993.748683
