Secrecy-achieving polar-coding

A polar coding scheme is suggested for the binary-input memoryless symmetric and degraded wire-tap channel. The provided scheme achieves the entire rate-equivocation region for the considered model.

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

[2]  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.

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

[4]  Shlomo Shamai,et al.  Secrecy-Achieving Polar-Coding for Binary-Input Memoryless Symmetric Wire-Tap Channels , 2010, ArXiv.

[5]  Shlomo Shamai,et al.  Information Theoretic Security , 2009, Found. Trends Commun. Inf. Theory.

[6]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[7]  Onur Ozan Koyluoglu,et al.  Polar coding for secure transmission and key agreement , 2010, 21st Annual IEEE International Symposium on Personal, Indoor and Mobile Radio Communications.

[8]  Emre Telatar,et al.  On the rate of channel polarization , 2008, 2009 IEEE International Symposium on Information Theory.

[9]  Emre Telatar,et al.  Polarization for arbitrary discrete memoryless channels , 2009, 2009 IEEE Information Theory Workshop.

[10]  Tie Liu,et al.  Security Embedding Codes , 2010, IEEE Transactions on Information Forensics and Security.