TY - JOUR
T1 - Hierarchical Polar Coding for Achieving Secrecy over State-Dependent Wiretap Channels Without Any Instantaneous CSI
AU - Si, Hongbo
AU - Koyluoglu, Onur Ozan
AU - Vishwanath, Sriram
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/9
Y1 - 2016/9
N2 - This paper presents a polar coding scheme to achieve secrecy in block fading binary symmetric wiretap channels without the knowledge of instantaneous channel state information (CSI) at the transmitter. For this model, a coding scheme that hierarchically utilizes polar codes is presented. In particular, on the polarization of different binary symmetric channels over different fading blocks, each channel use is modeled as an appropriate binary erasure channel over fading blocks. Polar codes are constructed for both coding over channel uses for each fading block and coding over fading blocks for certain channel uses. In order to guarantee security, random bits are introduced at appropriate places to exhaust the observations of the eavesdropper. It is shown that this coding scheme, without instantaneous CSI at the transmitter, is secrecy capacity achieving for the simultaneous fading scenario. For the independent fading case, the capacity is achieved when the fading realizations for the eavesdropper channel are always degraded with respect to the receiver. For the remaining cases, the gap between lower and upper bounds is analyzed. Remarkably, for the scenarios where the secrecy capacity is achieved, the results imply that the instantaneous CSI does not increase the secrecy capacity.
AB - This paper presents a polar coding scheme to achieve secrecy in block fading binary symmetric wiretap channels without the knowledge of instantaneous channel state information (CSI) at the transmitter. For this model, a coding scheme that hierarchically utilizes polar codes is presented. In particular, on the polarization of different binary symmetric channels over different fading blocks, each channel use is modeled as an appropriate binary erasure channel over fading blocks. Polar codes are constructed for both coding over channel uses for each fading block and coding over fading blocks for certain channel uses. In order to guarantee security, random bits are introduced at appropriate places to exhaust the observations of the eavesdropper. It is shown that this coding scheme, without instantaneous CSI at the transmitter, is secrecy capacity achieving for the simultaneous fading scenario. For the independent fading case, the capacity is achieved when the fading realizations for the eavesdropper channel are always degraded with respect to the receiver. For the remaining cases, the gap between lower and upper bounds is analyzed. Remarkably, for the scenarios where the secrecy capacity is achieved, the results imply that the instantaneous CSI does not increase the secrecy capacity.
KW - Fading channel
KW - information theoretic security
KW - polar coding
KW - wiretap channel
UR - http://www.scopus.com/inward/record.url?scp=84988589088&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84988589088&partnerID=8YFLogxK
U2 - 10.1109/TCOMM.2016.2592523
DO - 10.1109/TCOMM.2016.2592523
M3 - Article
AN - SCOPUS:84988589088
SN - 0090-6778
VL - 64
SP - 3609
EP - 3623
JO - IEEE Transactions on Communications
JF - IEEE Transactions on Communications
IS - 9
M1 - 7515136
ER -