Title :
The optimal linear worst-case information rate
Author :
Van Dijk, Marten
Author_Institution :
Philips Res. Lab., Eindhoven, Netherlands
fDate :
29 Jun-4 Jul 1997
Abstract :
We present a new approach to upper bound the worst-case information rate for linear secret sharing schemes. It is easier to apply than existing methods and in all examples considered so far it never leads to worse upper bounds
Keywords :
channel capacity; combinatorial mathematics; cryptography; combinatorial scheme; linear secret sharing schemes; optimal linear worst-case information rate; upper bound; Cryptography; Information rates; Laboratories; Probability distribution; Upper bound; Vectors;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613004
