| 参与者人数为五的超图存取结构的最优信息率 |
| |
| 引用本文： | 李志慧,杨丽杰.参与者人数为五的超图存取结构的最优信息率[J].计算机工程与应用,2015,51(8):109-112. |
| |
| 作者姓名： | 李志慧 杨丽杰 |
| |
| 作者单位： | 陕西师范大学 数学与信息科学学院，西安 710062 |
| |
| 基金项目： | 国家自然科学基金(No.11271237)。 |
| |
| 摘 要： | 针对参与者人数为5的超图存取结构的完善秘密共享方案及其最优信息率的精确值的问题，利用熵的有关性质和λ-]分解方法等对周展飞的博士论文中还未解决的6种超图存取结构的最优信息率的精确值进行了研究。计算出该6种超图存取结构最优信息率的精确值为4/7。
|
| 关 键 词： | 超图存取结构 最优信息率 完善的秘密共享方案 熵值法 &lambda -分解 |
Optimal information rate of hypergraph access structures on five participants |
| |
| LI Zhihui,YANG Lijie.Optimal information rate of hypergraph access structures on five participants[J].Computer Engineering and Applications,2015,51(8):109-112. |
| |
| Authors: | LI Zhihui YANG Lijie |
| |
| Affiliation: | College of Mathematics and Information Science, Shaanxi Normal University, Xi’an 710062, China |
| |
| Abstract: | For the realization and optimal information rate of perfect secret sharing schemes of a type of hypergraph access structures on five participants, the paper studies six hypergraph access structures which remained as open problems in Zhou Zhanfei’s doctoral thesis by using the properties of entropy and λ-]decomposition. It proves that the optimal information rate of the six hypergraph access structures is equal to 4/7. |
| |
| Keywords: | hypergraph access structure optimal information rate perfect secret sharing schemes entropy method λ-decomposition |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
