%0 Journal Article
%T 对3条超边的超圈存取结构最优信息率的一点注记<br>A note on the optimal information rate of hypercycle access structure with three hyperedges
%A 薛丽霞
%A 李志慧
%A 谢佳丽&lt
%A br&gt
%A XUE Li-xia
%A LI Zhi-hui
%A XIE Jia-li
%J 山东大学学报（理学版）
%D 2015
%R 10.6040/j.issn.1671-9352.0.2014.568
%X 摘要： 将含有3条超边的超圈存取结构分为两类:一类是任意一条超边都没有属于自己的独立点集;另一类是至少存在一条超边有属于自己的独立点集。对第一类超圈存取结构,用Shamir方案构造了一个理想的秘密共享方案,从而证明了其最优信息率等于1;对第二类超圈存取结构用信息论和λ-分解方法证明了其最优信息率等于2/3。给出了参与者人数为6、7且含有3条超边共86种互不同构的超圈存取结构,并计算了其最优信息率。<br>Abstract: The hypercycle access structures with three hyperedges is divided into two kinds:one kind is that any hyperedge has no its own independent point set, another kind is that there is at least one hyperedge which has its own independent point set. By using Shamir-threshold scheme, an ideal secret sharing scheme is constructed, and it is proved that the optimal information rate of the first kind of hypercycle access structures are equal to 1; Using information theory and λ-decomposition method, it is shown that the optimal information rate of the second kind of hypercycle access structures are equal to 2/3. Eighty-six hypercycle access structures with three hyperedges on six and seven participants, in which all of each other are not isomorphic, and their optimal information rates are calculated
%K 理想秘密共享方案
%K 超圈
%K 最优信息率
%K 存取结构
%K &lt
%K br&gt
%K access structure
%K ideal secret sharing scheme
%K hypercycle
%K optimal information rate
%U http://lxbwk.njournal.sdu.edu.cn/CN/10.6040/j.issn.1671-9352.0.2014.568