Set (k,n)-Exactly covering problem

• 作 者: Wu Zhenhuan Gao Ying Wu Zhehui
• 机 构: College of Information Science & Engineering
• 出 处: 高技术通讯（英文版）
• 发表日期: 2004年期
• 关键词: set (k n)-exact cover exactly covering match feasible assignment
• 基金项目: 国家自然科学基金

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.