Polar Codes for q-Ary Channels, q=2r

DOI10.1109/TIT.2012.2219035MaRDI QIDQ2989415zbMATH OpenOpenAlexFDO

Authors Woomyoung Park, Alexander Barg

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/1107.4965

Mathematics Subject Classification ID

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

Abstract: We study polarization for nonbinary channels with input alphabet of size q=2^r,r=2,3,... Using Arikan's polarizing kernel H_2, we prove that the virtual channels that arise in the process of polarization converge to q-ary channels with capacity 1,2,...,r bits, and that the total transmission rate approaches the symmetric capacity of the channel. This leads to an explicit transmission scheme for q-ary channels. The error probability of decoding using successive cancellation behaves as exp(-N^alpha), where N is the code length and {alpha} is any constant less than 0.5.

Cited in

(7)

• Exponents of polar codes using algebraic geometric code kernels
• Design and decoding of polar codes with large kernels: a survey
• Polar codes for distributed hierarchical source coding
• 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
• On the Finite Length Scaling of <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math> </inline-formula>-Ary Polar Codes
• Interactive function computation via polar coding

This page was built for publication: Polar Codes for $q$-Ary Channels, $q=2^{r}$

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