Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels
Eran Hof, Igal Sason, Shlomo Shitz Shamai, Chao Tian · IEEE Transactions on Information Theory · 2012
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.