Secure Polar Coding With REP and XOR Coding

In this letter, we study the secure data communication by polar coding. In polar coding, all bit-channels perfectly polarize when the codelength goes to infinity. With finite and practical codelength, however, many bit-channels do not perfectly polarize and this significantly degrades the secrecy rate. To address this issue, we propose to use repetition (REP) coding and exclusive-or (XOR) coding combined with polar coding. To make the proposed approach practical, we develop simple design methods for REP and XOR codings. Numerical results demonstrate that the proposed secure polar coding improves the secrecy rate and security gap considerably.

[1]  Upamanyu Madhow Fundamentals of Digital Communication: References , 2008 .

[2]  Shlomo Shamai,et al.  Secrecy-achieving polar-coding , 2010, 2010 IEEE Information Theory Workshop.

[3]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[4]  Mikael Skoglund,et al.  Nested Polar Codes for Wiretap and Relay Channels , 2010, IEEE Communications Letters.

[5]  Johannes B. Huber,et al.  An efficient length- and rate-preserving concatenation of polar and repetition codes , 2013, ArXiv.

[6]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[7]  Johannes B. Huber,et al.  Information Combining , 2006, Found. Trends Commun. Inf. Theory.

[8]  Il-Min Kim,et al.  BER-Based Physical Layer Security With Finite Codelength: Combining Strong Converse and Error Amplification , 2014, IEEE Transactions on Communications.

[9]  Alexander Vardy,et al.  Achieving the secrecy capacity of wiretap channels using Polar codes , 2010, ISIT.

[10]  Emre Telatar,et al.  On the correlation between polarized BECs , 2013, 2013 IEEE International Symposium on Information Theory.