Secrecy-Achieving Polar-Coding for Binary-Input Memoryless Symmetric Wire-Tap Channels

摘要

A polar coding scheme is introduced in this paper for the wire-tap channel.It is shown that the provided scheme achieves the entire rate-equivocationregion for the case of symmetric and degraded wire-tap channel, where the weaknotion of secrecy is assumed. For the particular case of binary erasurewire-tap channel, an alternative proof is given. The case of generalnon-degraded wire-tap channels is also considered.