Source and Channel Polarization Over Finite Fields and Reed–Solomon Matrices

DOI10.1109/TIT.2014.2312181zbMATH Open1360.94254arXiv1211.5264MaRDI QIDQ2986384FDOQ2986384

Authors: Ryuhei Mori, Toshiyuki Tanaka 

Publication date: 16 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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 $2imes2$ binary matrix used in the original proposal by Arikan.

Full work available at URL: https://arxiv.org/abs/1211.5264

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Combinatorial codes (94B25) Channel models (including quantum) in information and communication theory (94A40)

Cited In (4)

• 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
• General strong polarization

This page was built for publication: Source and Channel Polarization Over Finite Fields and Reed–Solomon Matrices

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