Source and Channel Polarization over Finite Fields and Reed-Solomon Matrices

Abstract

Polarization phenomenon over any finite field ${\mathbb{F}}_q$ with size $q$ being a power of a prime is considered. This problem is a generalization of the original proposal of channel polarization by Arikan for the binary field, as well as its extension to a prime field by Sasoglu, Telatar, and Arikan. In this paper, a necessary and sufficient condition of a matrix over a finite field ${\mathbb{F}}_q$ is shown under which any source and channel are polarized. Furthermore, the result of the speed of polarization for the binary alphabet obtained by Arikan and Telatar is generalized to arbitrary finite field. It is also shown that the asymptotic error probability of polar codes is improved by using the Reed-Solomon matrix, which can be regarded as a natural generalization of the $2\times 2$ binary matrix used in the original proposal by Arikan.

17 pages, 3 figures, accepted for publication in the IEEE Transactions on Information Theory

References in corpus (7)

• Polarization for arbitrary discrete memoryless channels
• Rate-Dependent Analysis of the Asymptotic Behavior of Channel Polarization
• Performance and Construction of Polar Codes on Symmetric Binary-Input Memoryless Channels
• On the scaling of Polar codes: I. The behavior of polarized channels
• Properties and Construction of Polar Codes
• Polar Codes for the m-User MAC
• Multilevel Polarization of Polar Codes Over Arbitrary Discrete Memoryless Channels

Cited by in corpus (7)

• Quantum secure direct communication with private dense coding using general preshared quantum state
• Log-logarithmic Time Pruned Polar Coding
• Polar Codes for Distributed Hierarchical Source Coding
• Generalizations of Fano's Inequality for Conditional Information Measures via Majorization Theory
• A Generalized Erasure Channel in the Sense of Polarization for Binary Erasure Channels
• Asymptotic Distribution of Multilevel Channel Polarization for a Certain Class of Erasure Channels
• Challenges and some new directions in channel coding