A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Capacity results for compound wiretap channels
2011
2011 IEEE Information Theory Workshop
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
doi:10.1109/itw.2011.6089569
dblp:conf/itw/BjelakovicBS11
fatcat:4ehvzqqcebhlpp6zcidk3v2dgm