2 research outputs found
Capacity-Achieving Polar Codes for Arbitrarily-Permuted Parallel Channels
Channel coding over arbitrarily-permuted parallel channels was first studied
by Willems et al. (2008). This paper introduces capacity-achieving polar coding
schemes for arbitrarily-permuted parallel channels where the component channels
are memoryless, binary-input and output-symmetric
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-equivocation
region for the case of symmetric and degraded wire-tap channel, where the weak
notion of secrecy is assumed. For the particular case of binary erasure
wire-tap channel, an alternative proof is given. The case of general
non-degraded wire-tap channels is also considered