๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Combinatorial shell bounds for generalization ability

โœ Scribed by D. A. Kochedykov

Book ID
110209703
Publisher
SP MAIK Nauka/Interperiodica
Year
2010
Tongue
English
Weight
408 KB
Volume
20
Category
Article
ISSN
1054-6618

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Combinatorial bounds for list decoding
Combinatorial bounds for list decoding
โœ Guruswami, V.; Hastad, J.; Sudan, M.; Zuckerman, D. ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› IEEE ๐ŸŒ English โš– 531 KB
Combinatorial lower bounds for secret sh
Combinatorial lower bounds for secret sharing schemes
โœ Kaoru Kurosawa; Koji Okada ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 286 KB

In a perfect secret sharing scheme, it holds that log, I%[ > H(S), where S denotes the secret and G denotes the set of the share of user i. On the other hand, it is well known that log213 > H(S) if S is not uniformly distributed, where ? denotes the set of secrets. In this case, log, @I > H(S) < log