On an infinite family of graphs with information ratio 2 - 1/k
From MaRDI portal
Publication:2390949
DOI10.1007/S00607-009-0039-6zbMATH Open1210.94067OpenAlexW1968383667MaRDI QIDQ2390949FDOQ2390949
Authors: László Csirmaz, Péter Ligeti 
Publication date: 10 August 2009
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-009-0039-6
Recommendations
Cites Work
- How to share a secret
- Title not available (Why is that?)
- Matroid representations by partitions
- An explication of secret sharing schemes
- On the size of shares for secret sharing schemes
- On the information rate of perfect secret sharing schemes
- Decomposition constructions for secret-sharing schemes
- Perfect secret sharing schemes on five participants
- Tight bounds on the information rate of secret sharing schemes
- The size of a share must be large
- Secret sharing schemes with three or four minimal qualified subsets
- Graph decompositions and secret sharing schemes
- Secret sharing schemes on graphs
- Theory of Cryptography
- Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
Cited In (14)
- Optimal information ratio of secret sharing schemes on Dutch windmill graphs
- Exact information ratios for secret sharing on small graphs with girth at least 5
- On the information ratio of graphs without high-degree neighbors
- Secret sharing based on Cartesian product of graphs
- Optimal complexity of secret sharing schemes with four minimal qualified subsets
- Secret sharing on infinite graphs
- Secret sharing on large girth graphs
- On the information ratio of graphs with many leaves
- An impossibility result on graph secret sharing
- Graph information ratio
- Secret sharing on the \(d\)-dimensional cube
- The optimal average information ratio of secret-sharing schemes for the access structures based on unicycle graphs and bipartite graphs
- On the optimization of bipartite secret sharing schemes
- Information Measures of Frequency Distributions with an Application to Labeled Graphs
Uses Software
This page was built for publication: On an infinite family of graphs with information ratio \(2 - 1/k\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390949)
