|
|||||
|
|
| Set （ k, n ）-Exactly covering problem | |
| 引用本文： | 吴振寰,Gao Ying,Wu Zhehui. Set （ k, n ）-Exactly covering problem[J]. 高技术通讯(英文版), 2010, 16(4): 433-436. DOI: 10.3772/j.issn.1006-6748.2010.04.017 |
| 作者姓名： | 吴振寰 Gao Ying Wu Zhehui |
| 作者单位： | College of Information Science ＆ Engineering, Shandong University of Science ＆ Technology, Qingdao 266510, P.R. China |
| 基金项目： | Supported by the National Natural Science Foundation of China （No. 60673053; 90718011）. |
| 摘 要： | <正> With the (k,n) -threshold scheme of secret sharing in the field of information security technology asan application background,the concept of set ( k,n)-exact cover is presented in this paper.It is a modificationof the original concept of set covering problem.It is also different from the concept of exact coverdefined by J.E.Hopcroft.Some properties of ( k,n) -exact cover are investigated;a sufficient conditionfor a set to be ( k,n ) -exactly coverable is given.It follows that a feasible assignment scheme of a set forthe (k,n) -exact cover is obtained if this set satisfies the sufficient condition. |
| 关 键 词： | 覆盖问题 信息安全技术 钾 氮 充分条件 秘密分享 应用程序 大肠杆菌 |
Set (k,n)-Exactly covering problem |
|
| Wu Zhenhuan,Gao Ying,Wu Zhehui. Set (k,n)-Exactly covering problem[J]. High Technology Letters, 2010, 16(4): 433-436. DOI: 10.3772/j.issn.1006-6748.2010.04.017 | |
| Authors: | Wu Zhenhuan Gao Ying Wu Zhehui |
| Affiliation: | Wu Zhenhuan, Gao Ying, Wu Zhehui (College of Information Science ＆ Engineering, Shandong University of Science ＆ Technology, Qingdao 266510, P.R. China) |
| Abstract: | With the(k,n)-threshold scheme of secret sharing in the field of information security technology as an application background,the concept of set(k,n)-exact cover is presented in this paper.It is a modification of the original concept of set covering problem.It is also different from the concept of exact cover defined by J.E.Hopcroft.Some properties of (k,n)-exact cover are investigated; a sufficient condition for a set to be (k,n)-exactly coverable is given.It follows that a feasible assignment scheme of a set for the (k,n)-exact cover is obtained if this set satisfies the sufficient condition. |
| Keywords: | set (k,n)-exact cover exactly covering match feasible assignment |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |