TY - GEN
T1 - Capacity results for compound wiretap channels
AU - Bjelaković, Igor
AU - Boche, Holger
AU - Sommerfeld, Jochen
PY - 2011
Y1 - 2011
N2 - 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 quite strong 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 and a multi-letter converse to the secrecy capacity of the compound wiretap channel without channel state information.
AB - 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 quite strong 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 and a multi-letter converse to the secrecy capacity of the compound wiretap channel without channel state information.
UR - http://www.scopus.com/inward/record.url?scp=83655202627&partnerID=8YFLogxK
U2 - 10.1109/ITW.2011.6089569
DO - 10.1109/ITW.2011.6089569
M3 - Conference contribution
AN - SCOPUS:83655202627
SN - 9781457704376
T3 - 2011 IEEE Information Theory Workshop, ITW 2011
SP - 60
EP - 64
BT - 2011 IEEE Information Theory Workshop, ITW 2011
T2 - 2011 IEEE Information Theory Workshop, ITW 2011
Y2 - 16 October 2011 through 20 October 2011
ER -