On Tightness of Mutual Dependence Upperbound for Secret-key Capacity of Multiple Terminals
| dc.creator | Chan, Chung | |
| dc.date | 2008-05-21 | |
| dc.date | 2008-06-16 | |
| dc.date.accessioned | 2026-07-07T09:44:26Z | |
| dc.date.available | 2026-07-07T09:44:26Z | |
| dc.description | Csiszar and Narayan[3] defined the notion of secret key capacity for multiple terminals, characterized it as a linear program with Slepian-Wolf constraints of the related source coding problem of communication for omniscience, and upper bounded it by some information divergence expression from the joint to the product distribution of the private observations. This paper proves that the bound is tight for the important case when all users are active, using the polymatroidal structure[6] underlying the source coding problem. When some users are not active, the bound may not be tight. This paper gives a counter-example in which 3 out of the 6 terminals are active. | |
| dc.description | 5 pages. This is a concise version. See the first version for detailed explanations and an illustration of the proof | |
| dc.identifier | https://arxiv.org/abs/0805.3200 | |
| dc.identifier | http://arxiv.org/abs/0805.3200 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/162875 | |
| dc.subject | Information Theory | |
| dc.subject | Cryptography and Security | |
| dc.subject | Combinatorics | |
| dc.subject | Probability | |
| dc.title | On Tightness of Mutual Dependence Upperbound for Secret-key Capacity of Multiple Terminals | |
| dc.type | text |