کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4949473 1440190 2017 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs
چکیده انگلیسی
In this paper, we derive bounds on the optimal average information ratio of the access structures based on general graphs and investigate the value of the ratio for unicycle graphs and some bipartite graphs. We determine the exact values of this ratio for some infinite classes of bipartite graphs and unicycle graphs. This extends previous results. We also provide good bounds on the optimal average information ratio for all unicycle graphs.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 233, 31 December 2017, Pages 131-142
نویسندگان
, ,