Channel Polarization on q-ary Discrete Memoryless Channels by Arbitrary Kernels

Abstract

A method of channel polarization, proposed by Arikan, allows us to construct efficient capacity-achieving channel codes. In the original work, binary input discrete memoryless channels are considered. A special case of $q$-ary channel polarization is considered by Sasoglu, Telatar, and Arikan. In this paper, we consider more general channel polarization on $q$-ary channels. We further show explicit constructions using Reed-Solomon codes, on which asymptotically fast channel polarization is induced.

5 pages, a final version of a manuscript for ISIT2010

References in corpus (3)

• Polarization for arbitrary discrete memoryless channels
• On the Rate of Channel Polarization
• Polar Codes are Optimal for Lossy Source Coding

Cited by in corpus (9)

• Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization
• Source and Channel Polarization over Finite Fields and Reed-Solomon Matrices
• Polar Codes with Mixed-Kernels
• Polar-like Codes and Asymptotic Tradeoff among Block Length, Code Rate, and Error Probability
• Using concatenated algebraic geometry codes in channel polarization
• Capacity-Achieving Polar Codes for Arbitrarily-Permuted Parallel Channels
• Binary Polarization Kernels from Code Decompositions
• Joint Write-Once-Memory and Error-Control Codes
• Non-Binary Polar Codes using Reed-Solomon Codes and Algebraic Geometry Codes