The optimal linear worst-case information rate

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.