Secret sharing schemes with three or four minimal qualified subsets. Designs, Codes and Cryptography 34 (2005) 17-34.

In this paper we study secret sharing schemes whose access structure has three or four minimal qualified subsets. The ideal case is completely characterized and for the non-ideal case we provide bounds on the optimal information rate.