Name
Abstract | ||
|---|---|---|
We prove that for $$d>1$$ d > 1 the best information ratio of the perfect secret sharing scheme based on the edge set of the d -dimensional cube is exactly d /2. Using the technique developed, we also prove that the information ratio of the infinite $$d$$ d -dimensional lattice is d . |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/s10623-013-9888-2 | Designs, Codes and Cryptography |
Keywords | DocType | Volume |
Secret sharing scheme,Polymatroid,Information theory,94A60,94A17,52B40,68R10 | Journal | 74 |
Issue | ISSN | Citations |
3 | 0925-1022 | 1 |
PageRank | References | Authors |
0.36 | 9 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| László Csirmaz | 1 | 163 | 15.86 |