On asymmetric coverings and covering numbers
- 1 January 2003
- journal article
- research article
- Published by Wiley in Journal of Combinatorial Designs
- Vol. 11 (3) , 218-228
Abstract
An asymmetric covering ${\cal D}(n,R)$ is a collection of special subsets S of an n‐set such that every subset T of the n‐set is contained in at least one special S with $|S| - |T| \le R$ . In this paper we compute the smallest size of any ${\cal D}(n,1)$ for $n \le 8.$ We also investigate “continuous” and “banded” versions of the problem. The latter involves the classical covering numbers $C(n,k,k-1)$ , and we determine the following new values: $C(10,5,4) = 51$ , $C(11,7,6) =84 $ , $C(12,8,7) = 126 $ , $C(13,9,8)= 185$ , and $C(14,10,9) = 259$ . We also find the number of non‐isomorphic minimal covering designs in several cases. © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 218–228, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/jcd.10022
Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Asymmetric Binary Covering CodesJournal of Combinatorial Theory, Series A, 2002
- New coverings oft-sets with (t + 1)-setsJournal of Combinatorial Designs, 1999
- The Magma Algebra System I: The User LanguageJournal of Symbolic Computation, 1997
- Programming with algebraic structures1994
- On the covering of t-sets with (t + 1)-sets:C(9, 5, 4) and C(10, 6, 5)Discrete Mathematics, 1991
- A new table of constant weight codesIEEE Transactions on Information Theory, 1990
- Remarques sur deux problemes extremauxDiscrete Mathematics, 1990