Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels

DOI10.1109/TIT.2012.2236971MaRDI QIDQ2989361zbMATH OpenFDO

Authors Eran Hof, Chao Tian, Igal Sason, S. Shamai

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1005.2770

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Linear codes (general theory) (94B05)

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.

Cited in

(3)

• On the Capacity of Constrained Permutation Codes for Rank Modulation
• Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
• Arikan meets Shannon: polar codes with near-optimal convergence to channel capacity

This page was built for publication: Capacity-Achieving Polar Codes for Arbitrarily Permuted Parallel Channels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989361)