Smallest Graphs Achieving the Stinson Bound

DOI10.1109/TIT.2020.2965102zbMath1446.94170arXiv1906.11598OpenAlexW2999232917MaRDI QIDQ5124451

Máté Gyarmati, Péter Ligeti

Publication date: 29 September 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.11598

zbMATH Keywords

perfect secret sharing schemeinformation ratio

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Authentication, digital signatures and secret sharing (94A62)

Related Items (2)

Secret sharing on regular bipartite access structures ⋮ On the information ratio of graphs without high-degree neighbors

This page was built for publication: Smallest Graphs Achieving the Stinson Bound