Secrecy results for compound wiretap channels

Details Secrecy results for compound wiretap channels Secrecy results for compound wiretap channels

2011-06-10

arxiv.org/abs/1106.2013v1

Computer Science

Information Theory

13 two-column pages, contains full arguments and extensions of our short paper http://arxiv.org/abs/1103.0135

Scientific paper

We derive a lower bound on the secrecy capacity of the compound wiretap channel with channel state information at the transmitter which matches the general upper bound on the secrecy capacity of general compound wiretap channels given by Liang et al. and thus establishing a full coding theorem in this case. We achieve this with a stronger secrecy criterion and with a decoder that is robust against the effect of randomisation in the encoding. This relieves us from the need of decoding the randomisation parameter which is in general not possible within this model. Moreover we prove a lower bound on the secrecy capacity of the compound wiretap channel without channel state information and derive a multi-letter expression for the capacity in this communication scenario.

Affiliated with

Also associated with

No associations

Rating

Secrecy results for compound wiretap channels 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 Secrecy results for compound wiretap channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secrecy results for compound wiretap channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-320216