Pages that link to "Item:Q2989337"
From MaRDI portal
The following pages link to Optimal Information Rate of Secret Sharing Schemes on Trees (Q2989337):
Displaying 15 items.
- Secret-sharing schemes for very dense graphs (Q290386) (← links)
- Improving the linear programming technique in the search for lower bounds in secret sharing (Q1648816) (← links)
- On the information ratio of non-perfect secret sharing schemes (Q1688395) (← links)
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs (Q1726013) (← links)
- Reduced access structures with four minimal qualified subsets on six participants (Q1783720) (← links)
- Exact information ratios for secret sharing on small graphs with girth at least 5 (Q2003345) (← links)
- On the information ratio of graphs without high-degree neighbors (Q2231745) (← links)
- Secret sharing on the \(d\)-dimensional cube (Q2260799) (← links)
- The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs (Q2410257) (← links)
- Optimal linear secret sharing schemes for graph access structures on six participants (Q2632007) (← links)
- Secret sharing on large girth graphs (Q2632835) (← links)
- Secret sharing on regular bipartite access structures (Q2701503) (← links)
- Ideal secret sharing schemes on graph-based $3$-homogeneous access structures (Q4958087) (← links)
- (Q5140836) (← links)
- Bipartite secret sharing and staircases (Q6124455) (← links)
