首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Single change covering designs
Authors:W D Wallis  J L Yucas  G -H Zhang
Institution:(1) Department of Mathematics, Southern Illinois University, 62901-4408 Carbondale, IL;(2) Department of Mathematics, Sonoma State University, 94928 Rohnert Park, CA
Abstract:A single-change covering designSC (v, k, b) on av-setV is a sequence ofb k-sets (blocks) onV which together cover every pair of elements ofV at least once, such that two successive blocks havek–1 elements in common. It is desirable to minimizeb. Some constructions and lower bounds forb are given.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号