Secret sharing schemes with five minimal qualified subsets

One of the important parameters of the secret sharing scheme is information rate, which defines the size of distributed information among the shareholders corresponds to size of their secret key. Generally, for any given access structure, it is not possible that one can find the information rate of secret sharing schemes. In this paper, an upper bound of information rate is presented with using independent sequence method, then, we study secret sharing schemes whose access structure has five minimal qualified subsets such that the ideal secret sharing schemes case some of the characterized and for the non-ideal case we provide bounds on the optimal information rate.