Secret sharing on the d-dimensional cube
classification
💻 cs.CR
math.CO
keywords
dimensionalcubeinformationproveratiosecretsharingbest
read the original abstract
We prove that for $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$-dimensional lattice is $d$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.