-
64浏览
-
0点赞
-
0收藏
-
0分享
-
75下载
-
0评论
-
引用
期刊论文
Kirkman packing designs KPD ({w; s*}, v) and related threshold schemes
H. Gao, B. Du. Discrete Mathematics 281 (2004) 83-95,-0001,():
A Kirkman packing design KPD ({w, s*}, v) is a resolvable packing with maximum possible number of parallel classes, each class containing one block of size s and all other blocks of size w. A (t, w)-threshold scheme is a way of distributing partial information (shadows) to w participants, so that any t of them can easily calculate a key, but no subset of fewer than t participants can determine the key. In this paper we improve the existence results on KPD ({3, s*}, v) for s = 4, 5. We also obtain some results on KPD ({4, s*}, v) for s = 5, 6. These results can be used to give some new (2, w)-threshold schemes.
【免责声明】以下全部内容由[杜北梁]上传于[2007年03月09日 16时04分43秒],版权归原创者所有。本文仅代表作者本人观点,与本网站无关。本网站对文中陈述、观点判断保持中立,不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考,并请自行承担全部责任。
本学者其他成果
同领域成果