Information Rates for Secret Sharing over Various Access Structures.
dc.contributor.author | Metcalf-Burton, Jessica Ruth | en_US |
dc.date.accessioned | 2009-09-03T14:47:05Z | |
dc.date.available | NO_RESTRICTION | en_US |
dc.date.available | 2009-09-03T14:47:05Z | |
dc.date.issued | 2009 | en_US |
dc.date.submitted | en_US | |
dc.identifier.uri | https://hdl.handle.net/2027.42/63729 | |
dc.description.abstract | Many open questions in secret sharing ask about the information rate of a particular access structure or class of access structures. Here we improve the best known upper bounds on the information rates of the access structures induced by the Vamos matroid from 10/11 to 8/9 for V1 and from 9/10 to 17/19 for V6. The method we introduce to obtain the bound for V6 can be generalized and applied to all other known 4-variable non-Shannon information inequalities. We also find the exact information rates for the infinitely many minor-minimal, non-matroid-related access structures whose rates were not previously known. On the topic of information inequalities, we show that the Ingleton inequality holds under certain independence assumptions and use this formulation to get a new proof of the Zhang-Yeung non-Shannon inequality. | en_US |
dc.format.extent | 430293 bytes | |
dc.format.extent | 1373 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | en_US |
dc.subject | Secret Sharing | en_US |
dc.subject | Vamos Matroid | en_US |
dc.subject | Information Inequalities | en_US |
dc.subject | Access Structure | en_US |
dc.subject | Information Rate | en_US |
dc.subject | Shannon Entropy | en_US |
dc.title | Information Rates for Secret Sharing over Various Access Structures. | en_US |
dc.type | Thesis | en_US |
dc.description.thesisdegreename | PhD | en_US |
dc.description.thesisdegreediscipline | Mathematics | en_US |
dc.description.thesisdegreegrantor | University of Michigan, Horace H. Rackham School of Graduate Studies | en_US |
dc.contributor.committeemember | Blass, Andreas R. | en_US |
dc.contributor.committeemember | Burns, Jr., Daniel M. | en_US |
dc.contributor.committeemember | Compton, Kevin J. | en_US |
dc.contributor.committeemember | Gilbert, Anna Catherine | en_US |
dc.contributor.committeemember | Hochster, Melvin | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/63729/1/jmetcalf_1.pdf | |
dc.owningcollname | Dissertations and Theses (Ph.D. and Master's) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.