Abstract
The 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
