Information Rates of Minimal Non-Matroid-Related Access Structures
| dc.creator | Metcalf-Burton, Jessica Ruth | |
| dc.date | 2008-01-23 | |
| dc.date.accessioned | 2026-07-07T08:57:01Z | |
| dc.date.available | 2026-07-07T08:57:01Z | |
| dc.description | In a secret sharing scheme, shares of a secret are distributed to participants in such a way that only certain predetermined sets of participants are qualified to reconstruct the secret. An access structure on a set of participants specifies which sets are to be qualified. The information rate of an access structure is a bound on how efficient a secret sharing scheme for that access structure can be. Marti-Farre and Padro showed that all access structures with information rate greater than two-thirds are matroid-related, and Stinson showed that four of the minor-minimal, non-matroid-related access structures have information rate exactly two-thirds. By a result of Seymour, there are infinitely many remaining minor-minimal, non-matroid-related access structures. In this paper we find the exact information rates for all such structures. | |
| dc.description | 8 pages | |
| dc.identifier | https://arxiv.org/abs/0801.3642 | |
| dc.identifier | http://arxiv.org/abs/0801.3642 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/146814 | |
| dc.subject | Cryptography and Security | |
| dc.subject | Combinatorics | |
| dc.title | Information Rates of Minimal Non-Matroid-Related Access Structures | |
| dc.type | text |