Polar coding for reliable communications over parallel channels

Abstract
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.

This publication has 5 references indexed in Scilit: