Pages that link to "Item:Q2003345"
From MaRDI portal
The following pages link to Exact information ratios for secret sharing on small graphs with girth at least 5 (Q2003345):
Displaying 8 items.
- An impossibility result on graph secret sharing (Q1039271) (← links)
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs (Q1726013) (← links)
- On the information ratio of graphs without high-degree neighbors (Q2231745) (← links)
- On an infinite family of graphs with information ratio \(2 - 1/k\) (Q2390949) (← links)
- Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007) (← links)
- Secret sharing on large girth graphs (Q2632835) (← links)
- The lower bound and exact value of the information rate of some developed graph access structures (Q5145937) (← links)
- On the Information Ratio of Graphs with Many Leaves (Q5234652) (← links)