Binary Polarization Kernels From Code Decompositions

DOI10.1109/TIT.2015.2409257MaRDI QIDQ2978599zbMATH OpenOpenAlexFDO

Authors Noam Presman, Ofer Shapira, Tuvi Etzion, Alexander Vardy, Simon Litsyn

Publication date 28 April 2017

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

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Abstract: In this paper, code decompositions (a.k.a. code nestings) are used to design binary polarization kernels. The proposed kernels are in general non-linear. They provide a better polarization exponent than the previously known kernels of the same dimensions. In particular, non-linear kernels of dimensions 14, 15, and 16 are constructed and are shown to have optimal asymptotic error-correction performance. The optimality is proved by showing that the exponents of these kernels achieve a new upper bound that is developed in this paper.

Recommendations

• The polarization of hybrid multi-kernel polar codes
• Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels
• Linear and Nonlinear Binary Kernels of Polar Codes of Small Dimensions With Maximum Exponents
• Polarization and polar codes
• scientific article; zbMATH DE number 871187
• scientific article; zbMATH DE number 820513
• Design and decoding of polar codes with large kernels: a survey
• Reed-Muller Codes Polarize
• Learning by Kernel Polarization
• Polar codes

Cited in

(2)

• Recursive descriptions of polar codes
• Design and decoding of polar codes with large kernels: a survey

This page was built for publication: Binary Polarization Kernels From Code Decompositions

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