Capacity-Achieving Polar Codes for Arbitrarily-Permuted Parallel Channels
Information Theory
2015-03-17 v3 math.IT
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.
Keywords
Cite
@article{arxiv.1005.2770,
title = {Capacity-Achieving Polar Codes for Arbitrarily-Permuted Parallel Channels},
author = {Eran Hof and Igal Sason and Shlomo Shamai and Chao Tian},
journal= {arXiv preprint arXiv:1005.2770},
year = {2015}
}