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

Kronecker productpolar codesexponentpartial distancespolarization ratepolarizing matrix

Mathematics Subject Classification ID

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

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.

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

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
• 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)