On Tightness of Mutual Dependence Upperbound for Secret-key Capacity of Multiple Terminals

Details On Tightness of Mutual Dependence Upperbound for Secret-key Capacity of Multiple Terminals On Tightness of Mutual Dependence Upperbound for Secret-key Capacity of Multiple Terminals

2008-05-21

arxiv.org/abs/0805.3200v2

Computer Science

Information Theory

5 pages. This is a concise version. See the first version for detailed explanations and an illustration of the proof

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On Tightness of Mutual Dependence Upperbound for Secret-key Capacity of Multiple Terminals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Tightness of Mutual Dependence Upperbound for Secret-key Capacity of Multiple Terminals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Tightness of Mutual Dependence Upperbound for Secret-key Capacity of Multiple Terminals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-289857