Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels
Academic Article
Overview
Identity
Additional Document Info
View All
Overview
abstract
Channel coding over arbitrarily permuted parallel channels was first studied by Willems and coworkers. This paper introduces capacity-achieving polar coding schemes for arbitrarily permuted parallel channels where the component channels are memoryless, binary-input, and output-symmetric. 1963-2012 IEEE.