Constructs smaller δ-regular graph families on c·2^δ vertices that achieve the Stinson information ratio bound (δ+1)/2 for secret sharing schemes.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Smallest graphs achieving the Stinson bound
Constructs smaller δ-regular graph families on c·2^δ vertices that achieve the Stinson information ratio bound (δ+1)/2 for secret sharing schemes.