On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes (Q3019920)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5934135
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes |
scientific article; zbMATH DE number 5934135 |
Statements
On the Combinatorial Approaches of Computing Upper Bounds on the Information Rate of Secret Sharing Schemes (English)
0 references
29 July 2011
0 references
secret sharing scheme
0 references
graph-based access structure
0 references
independent sequence
0 references
alternating cycle-free matching of a bipartite graph
0 references
0.9340726
0 references
0.9298762
0 references
0.9257077
0 references
0.92326605
0 references
0.9217305
0 references
0.90973216
0 references
0.9090973
0 references
0.9031539
0 references
