Polar coding for reliable communications over parallel channels

A capacity-achieving polar coding scheme is introduced for reliable communications over a set of parallel communication channels. They are assumed to be arbitrarily-permuted memoryless binary-input and output-symmetric (MBIOS) channels, and they form a set of (stochastically) degraded channels. The general case where the parallel channels are not necessarily degraded is addressed in the full paper version [3], though the suggested scheme is not capacity-achieving in the general case.

[1]  Rüdiger L. Urbanke,et al.  The compound capacity of polar codes , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[2]  Emre Telatar,et al.  On the rate of channel polarization , 2008, 2009 IEEE International Symposium on Information Theory.

[3]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[4]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[5]  Neil J. A. Sloane,et al.  The theory of error-correcting codes (north-holland , 1977 .

[6]  Alexei Gorokhov,et al.  Signaling Over Arbitrarily Permuted Parallel Channels , 2008, IEEE Transactions on Information Theory.