Capacity-Achieving Polar Codes for Arbitrarily-Permuted Parallel Channels

Abstract

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.

References in corpus (3)

• Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
• Polarization for arbitrary discrete memoryless channels
• Channel Polarization on q-ary Discrete Memoryless Channels by Arbitrary Kernels

Cited by in corpus (1)

• Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization