arXiv · 1310.4640
Secret sharing on the $d$-dimensional cube
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$.
Explore related subjects
Keep this discovery
Laszlo Csirmaz. 2013-10-17. Secret sharing on the $d$-dimensional cube. https://doi.org/10.1007/s10623-013-9888-2
Cite the original work for its findings. Save a collection to share your selection of sources.