The exponent of a polarizing matrix constructed from the Kronecker product

DOI10.1007/S10623-012-9689-ZMaRDI QIDQ2439734zbMATH OpenOpenAlexFDO

Authors Myung-Kyu Lee, Kyeongcheol Yang

Publication date 17 March 2014

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

exponentKronecker productpartial distancespolar codespolarization ratepolarizing matrix

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other matrix groups over finite fields (20H30) Coding theorems (Shannon theory) (94A24)

Abstract: The asymptotic performance of a polar code under successive cancellation decoding is determined by the exponent of its polarizing matrix. We first prove that the partial distances of a polarizing matrix constructed from the Kronecker product are simply expressed as a product of those of its component matrices. We then show that the exponent of the polarizing matrix is shown to be a weighted sum of the exponents of its component matrices. These results may be employed in the design of a large polarizing matrix with high exponent.

Review text

The paper is a continuation of [\textit{S. B. Korada, E. Şaşoglu} and \textit{R. Urbanke}, ``Polar codes: characterization of exponent, bounds, and constructions, IEEE Trans. Inf. Theory 56, No. 12, 6253--6264 (2010)], defining a new result concerning polar codes: in a symmetric binary-input discrete memoryless channel, the partial distances (and therefore the exponent) of polarizing matrix \(A\otimes B\) -- where \(\otimes\) is the Kronecker product -- can be effectively obtained from partial distances (exponents) of matrices \(A\) and \(B\). These two results are presented in Theorem 7 and respectively Corollary 8; the rest of the paper is mainly dedicated to the proof of these assertions. The paper is interesting, rigorously written, valuable by its result -- which can be extended to a non-binary case, and by its potential applications in all codes based by Kronecker product. As a small critical remark, there are some weaknesses in writing the paper. For example, the main notion - polarizing matrix - is not defined, and the reader has to look for it in the references. Also, for the same term \(E(G)\) two names are used: \textit{rate of polarization} and \textit{exponent}; this seems to be an ambiguity inherited from the paper cited in the beginning.

Recommendations

• Exponents of polar codes using algebraic geometric code kernels
• On the Kronecker products and their applications
• Polarization and polar codes
• The polarization of hybrid multi-kernel polar codes

Cites work

• Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Polar Codes: Characterization of Exponent, Bounds, and Constructions

Cited in

(1)

• Exponents of polar codes using algebraic geometric code kernels

This page was built for publication: The exponent of a polarizing matrix constructed from the Kronecker product

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