Optimal Information Rates of Novel Graph Based Access Structures
Mingkun Yang · 2009
The optimal information rate of a graph (based access structure) is the best achievable information rate of any PSSS realizing it, which has been studied in a large number of articles during the last two decades. However the optimal information rates are only known for certain graphs. It is an open problem to determine the optimal information rates of other graphs. In this paper, we provide optimal information rates for a novel infinite family of graphs based on a nontrivial relationship between a graph and its subgraphs.