Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Symposium on Information Theory (ISIT)

Large Kernel Construction Based on Generalized Polarization Transforms

Anatolii Ashikhmin, Peter Trifonov

Published Jun 1, 2026• 0 citations
Publisher

Abstract

A novel method for constructing polarization transforms is presented. It can be employed for constructing large kernels. We show that the polarization transforms of polar codes with large kernels and convolutional polar codes can be constructed by employing the proposed framework.A new kernel search algorithm is presented. It takes a given kernel and tries to find kernels with better polarization properties of lower processing complexity, applying elementary row operations to close rows.Novel kernels of size 64 with improved rate of polarization and processing complexity are obtained.

DOI
10.1109/isit62367.2026.11654106

Related papers

Fast Search Method for Large Polarization Kernels

Grigorii Trofimiuk

A novel search method for large polarization kernels is proposed. The algorithm produces a kernel with given partial distances by employing the depth-first search combined with the computation of coset leaders weight tables and sufficient conditions of code non-equivalence. Using the proposed method, we improved all existing lower bounds on the maximum error exponent for kernels of size from 17 to 29. We also obtained kernels which admit low complexity processing by the recently proposed recursive trellis algorithm. Numerical results demonstrate the advantage of polar codes with the obtained kernels compared with shortened polar codes and polar codes with small kernels.

arXiv:2310.08369•IEEE Transactions on Communications•Oct 16, 2023•3 citations

Polar List Decoding for Large Polarization Kernels

Bhaskar Gupta, Hanwen Yao, Arman Fazeli +1 more

Polar codes constructed with large polarization kernels were recently proven to be able to achieve optimal finite-length scaling properties. However, straightforward decoding for large kernel polar codes introduces a complexity coefficient that is exponential to the kernel sizes, which makes such codes generally believed to be impractical. In this paper, we present a new method that decodes large kernel polar codes with a complexity coefficient that is polynomial to the kernel sizes. This could facilitate the implementation of large kernel polar codes for practical use in the future.Successive cancellation decoding for large kernel polar codes requires calculation on the probabilities of its bit channels. Similar to conventional polar codes, those bit channels follow a recursive relation, which make this calculation boil down to computing the probabilities for bit channels of a single polarization kernel. This kernel-level computation can be shown equivalent to soft-output maximum-likelihood (ML) decoding on a single bit of a linear block code. In our proposed method, we first use linear operations to represent the considered linear block code as a polar code with dynamically frozen bits, and then use a modified polar list decoder to get an approximate value on the soft-output of the desired bit. This method is motivated by the observation that at short block lengths, polar list decoding with a large enough list size can well-approximate ML decoding. The proposed low-complexity method allows us to decode polar codes constructed with a 64 × 64 polarization kernel with scaling exponent µ ≈ 2.87 for the first time.

IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2021•7 citations

Shortened Polarization Kernels

Grigorii Trofimiuk

A shortening method for large polarization kernels is presented, which results in shortened kernels with the highest error exponent if applied to kernels of size up to 32. It uses lower and upper bounds on partial distances for quick elimination of unsuitable shortening patterns.The proposed algorithm is applied to some kernels of sizes 16 and 32 to obtain shortened kernels of sizes from 9 to 31. These kernels are used in mixed-kernel polar codes of various lengths. Numerical results demonstrate the advantage of polar codes with shortened large kernels compared with shortened and punctured Arikan polar codes, and polar codes with small kernels.

arXiv:2110.07351•IEEE Globecom Workshops (GC Wkshps)•Dec 1, 2021•6 citations

Generalized Concatenated Polarization Kernels

Peter Trifonov

A novel class of polarization kernels is proposed, which is based on the construction of generalized concatenated codes. The complexity of the kernel processing operation, which is the computational core of the (list) successive cancellation decoder, for the obtained kernels of size 64 is several orders of magnitude less compared to BCH and Yao-Fazeli-Vardy kernels. Polar subcodes based on the obtained kernels under list successive cancellation decoder provide both performance and complexity improvement with respect to those based on the Arikan kernel.

IEEE International Symposium on Information Theory (ISIT)•Jul 7, 2024•1 citation

Convolutional Polar Kernels

Ruslan Morozov

A family of polarizing kernels is presented together with polynomial-complexity algorithm for computing scaling exponent. The proposed convolutional polar kernels are based on convolutional polar codes, also known as b-MERA codes. For these kernels, a polynomial-complexity algorithm is proposed to find weight spectrum of unrecoverable erasure patterns, needed for computing scaling exponent. As a result, we obtain scaling exponent and polarization rate for convolutional polar kernels of size up to 1024.

arXiv:2008.11611•IEEE Transactions on Communications•Sep 23, 2020•5 citations

REP Node Modification and Fast Decoding of Multi-Kernel Polar Codes Constructed with a New 5 × 5 Kernel

Changwei Tu, Youyan Zhang, Zhiliang Huang

Multi-kernel polar codes, which are constructed by different sizes of kernels make the length of the traditional polar code more flexible. In this paper, we extend the multi-kernel polar codes to 5×5 kernels including kernel design, code design, and fast decoding. First, we construct a new 5×5 kernel with the maximum polarization rate. The first row of this kernel is an all-one vector, which enable us to find the relation between node modification and distance property of multi-kernel polar codes. Second, we modify the repetition (REP) nodes to the new 5×5 kernel, which can increase the distance property of the constructed polar codes, improve the decoding performance and reduce memory requirements during the fast decoding. In addition, we find our REP node modification can be generalized to multi-kernel polar codes when the first row of the used kernels is all-one vector. Third, we prove the four kinds of basic nodes (Rate-1 node, Rate-0 nodes, Repetition (REP) nodes, and Single-Parity check (SPC) nodes) of fast decoding are suitable for the new kernel. Moreover, we generalize the Generalized Parity-Check (G-PC) nodes and the Generalized Repetition (GREP) nodes, which are suitable for multi-kernel polar codes constructed by any size of kernels and any order of kernels. By simulations, we show that our modification improves the error-rate performance of the fast decoding. Meanwhile, the fast decoding of our multi-kernel polar codes has at least 68.4% latency reduction compared with the traditional SC decoder in all cases considered where code lengths are 80, 135, 400, and 675.

IEICE Transactions on Communications•Apr 17, 2025•1 citation
A novel method for constructing polarization transforms is presented. It can be employed for constructing large kernels. We show that the polarization transforms of polar codes with large kernels and convolutional polar codes can be constructed by employing the proposed framework.A new kernel search algorithm is presented. It takes a given kernel and tries to find kernels with better polarization properties of lower processing complexity, applying elementary row operations to close rows.Novel kernels of size 64 with improved rate of polarization and processing complexity are obtained.
A novel search method for large polarization kernels is proposed. The algorithm produces a kernel with given partial distances by employing the depth-first search combined with the computation of coset leaders weight tables and sufficient conditions of code non-equivalence. Using the proposed method, we improved all existing lower bounds on the maximum error exponent for kernels of size from 17 to 29. We also obtained kernels which admit low complexity processing by the recently proposed recursive trellis algorithm. Numerical results demonstrate the advantage of polar codes with the obtained kernels compared with shortened polar codes and polar codes with small kernels.
Polar codes constructed with large polarization kernels were recently proven to be able to achieve optimal finite-length scaling properties. However, straightforward decoding for large kernel polar codes introduces a complexity coefficient that is exponential to the kernel sizes, which makes such codes generally believed to be impractical. In this paper, we present a new method that decodes large kernel polar codes with a complexity coefficient that is polynomial to the kernel sizes. This could facilitate the implementation of large kernel polar codes for practical use in the future.Successive cancellation decoding for large kernel polar codes requires calculation on the probabilities of its bit channels. Similar to conventional polar codes, those bit channels follow a recursive relation, which make this calculation boil down to computing the probabilities for bit channels of a single polarization kernel. This kernel-level computation can be shown equivalent to soft-output maximum-likelihood (ML) decoding on a single bit of a linear block code. In our proposed method, we first use linear operations to represent the considered linear block code as a polar code with dynamically frozen bits, and then use a modified polar list decoder to get an approximate value on the soft-output of the desired bit. This method is motivated by the observation that at short block lengths, polar list decoding with a large enough list size can well-approximate ML decoding. The proposed low-complexity method allows us to decode polar codes constructed with a 64 × 64 polarization kernel with scaling exponent µ ≈ 2.87 for the first time.
A shortening method for large polarization kernels is presented, which results in shortened kernels with the highest error exponent if applied to kernels of size up to 32. It uses lower and upper bounds on partial distances for quick elimination of unsuitable shortening patterns.The proposed algorithm is applied to some kernels of sizes 16 and 32 to obtain shortened kernels of sizes from 9 to 31. These kernels are used in mixed-kernel polar codes of various lengths. Numerical results demonstrate the advantage of polar codes with shortened large kernels compared with shortened and punctured Arikan polar codes, and polar codes with small kernels.
A novel class of polarization kernels is proposed, which is based on the construction of generalized concatenated codes. The complexity of the kernel processing operation, which is the computational core of the (list) successive cancellation decoder, for the obtained kernels of size 64 is several orders of magnitude less compared to BCH and Yao-Fazeli-Vardy kernels. Polar subcodes based on the obtained kernels under list successive cancellation decoder provide both performance and complexity improvement with respect to those based on the Arikan kernel.
A family of polarizing kernels is presented together with polynomial-complexity algorithm for computing scaling exponent. The proposed convolutional polar kernels are based on convolutional polar codes, also known as b-MERA codes. For these kernels, a polynomial-complexity algorithm is proposed to find weight spectrum of unrecoverable erasure patterns, needed for computing scaling exponent. As a result, we obtain scaling exponent and polarization rate for convolutional polar kernels of size up to 1024.
Multi-kernel polar codes, which are constructed by different sizes of kernels make the length of the traditional polar code more flexible. In this paper, we extend the multi-kernel polar codes to 5×5 kernels including kernel design, code design, and fast decoding. First, we construct a new 5×5 kernel with the maximum polarization rate. The first row of this kernel is an all-one vector, which enable us to find the relation between node modification and distance property of multi-kernel polar codes. Second, we modify the repetition (REP) nodes to the new 5×5 kernel, which can increase the distance property of the constructed polar codes, improve the decoding performance and reduce memory requirements during the fast decoding. In addition, we find our REP node modification can be generalized to multi-kernel polar codes when the first row of the used kernels is all-one vector. Third, we prove the four kinds of basic nodes (Rate-1 node, Rate-0 nodes, Repetition (REP) nodes, and Single-Parity check (SPC) nodes) of fast decoding are suitable for the new kernel. Moreover, we generalize the Generalized Parity-Check (G-PC) nodes and the Generalized Repetition (GREP) nodes, which are suitable for multi-kernel polar codes constructed by any size of kernels and any order of kernels. By simulations, we show that our modification improves the error-rate performance of the fast decoding. Meanwhile, the fast decoding of our multi-kernel polar codes has at least 68.4% latency reduction compared with the traditional SC decoder in all cases considered where code lengths are 80, 135, 400, and 675.