Weighted decomposition construction for perfect secret sharing schemes

AbstractThe purpose of this paper is to present a new decomposition technique, called the weighted decomposition construction, for perfect secret sharing schemes with general access structures. This construction is more general than previous constructions. Based on the weighted decomposition construction, we improve the information rates in four cases out of the 18 cases of secret sharing schemes left unsolved for connected graphs on six vertices