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 modifi...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. Hopcmft. 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 eover is obtained if this set satisfies the sufficient condition.展开更多
基金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 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. Hopcmft. 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 eover is obtained if this set satisfies the sufficient condition.
