Improved Upper Bounds for the Information Rates of the Secret Sharing Schemes Induced by the Vamos Matroid
| dc.creator | Metcalf-Burton, Jessica Ruth | |
| dc.date | 2008-09-17 | |
| dc.date.accessioned | 2026-07-07T10:03:39Z | |
| dc.date.available | 2026-07-07T10:03:39Z | |
| dc.description | An access structure specifying the qualified sets of a secret sharing scheme must have information rate less than or equal to one. The Vamos matroid induces two non-isomorphic access structures V1 and V6, which were shown by Marti-Farre and Padro to have information rates of at least 3/4. Beimel, Livne, and Padro showed that the information rates of V1 and V6 are bounded above by 10/11 and 9/10 respectively. Here we improve those upper bounds to 19/21 for V1 and 17/19 for V6. | |
| dc.identifier | https://arxiv.org/abs/0809.3010 | |
| dc.identifier | http://arxiv.org/abs/0809.3010 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/169369 | |
| dc.subject | Cryptography and Security | |
| dc.subject | Information Theory | |
| dc.title | Improved Upper Bounds for the Information Rates of the Secret Sharing Schemes Induced by the Vamos Matroid | |
| dc.type | text |