Capacity-Achieving Polar Codes for Arbitrarily-Permuted Parallel Channels

TL;DR

This paper develops capacity-achieving polar coding schemes for arbitrarily permuted parallel channels with memoryless, binary-input, output-symmetric components, expanding the applicability of polar codes in complex channel configurations.

Contribution

It introduces novel polar coding schemes that achieve capacity for arbitrarily permuted parallel channels with specific properties, a new extension of polar coding theory.

Findings

Polar codes can achieve capacity in arbitrarily permuted parallel channels.

The proposed schemes are applicable to channels with memoryless, binary-input, output-symmetric components.

The work extends polar coding theory to more complex channel arrangements.

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.