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

International Symposium on Problems of Redundancy in Information and Control Systems (REDUNDANCY)

Directed search decoding of polar codes with Reed-Solomon kernel

Ruslan Morozov, Peter Trifonov

Published Sep 1, 2016• 0 citations
Publisher

Abstract

The directed search algorithm, introduced originally for decoding of polar codes with Arikan kernel, is generalized to the case of a Reed-Solomon kernel. The algorithm relies heavily on the knowledge of symbol subchannel error probabilities of the polarizing transformation. A method to approximate these probabilities is suggested. The proposed method results in almost the same complexity and performance as in the case of the decoder using exact values of error probabilities.

DOI
10.1109/red.2016.7779336

Related papers

Algebraic Matching Techniques for Fast Decoding of Polar Codes with Reed-Solomon Kernel

Peter Trifonov

We propose to reduce the decoding complexity of polar codes with non-Arikan kernels by employing a (near) ML decoding algorithm for the codes generated by kernel rows. A generalization of the order statistics algorithm is presented for soft decoding of Reed-Solomon codes. Algebraic properties of the Reed-Solomon code are exploited to increase the reprocessing order. The obtained algorithm is used as a building block to obtain a decoder for polar codes with Reed-Solomon kernel.

arXiv:1804.00620•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2018•3 citations

Window Processing of Binary Polarization Kernels

Grigorii Trofimiuk, Peter Trifonov

A decoding algorithm for polar (sub)codes with binary 2t×2tpolarization kernels is presented. It is based on the window processing (WP) method, which exploits the linear relationship of the polarization kernels and the Arikan matrix. This relationship enables one to compute the kernel input symbols probabilities by computing the probabilities of several paths in Arikan successive cancellation (SC) decoder. In this paper we propose an improved version of WP, which has significantly lower arithmetic complexity and operates in log-likelihood ratios (LLRs) domain. The algorithm identifies and reuses common subexpressions arising in computation of Arikan SC path scores. The proposed algorithm is applied to kernels of size 16 and 32 with improved polarization properties. It enables polar (sub)codes with the considered kernels to simultaneously provide better performance and lower decoding complexity compared with polar (sub)codes with Arikan kernel.

arXiv:2010.07884•IEEE Transactions on Communications•Apr 12, 2021•21 citations

Efficient decoding of polar codes with some 16×16 kernels

Grigorii Trofimiuk, Peter Trifonov

A decoding algorithm for polar codes with binary 16×16 kernels with polarization rate 0.51828 and scaling exponents 3.346 and 3.450 is presented. The proposed approach exploits the relationship of the considered kernels and the Arikan matrix to significantly reduce the decoding complexity without any performance loss. Simulation results show that polar (sub)codes with 16×16 kernels can outperform polar codes with Arikan kernel, while having lower decoding complexity.

arXiv:2001.03921•IEEE Information Theory Workshop (ITW)•Nov 1, 2018•21 citations

Sequential decoding of polar codes with arbitrary binary kernel

Vera Miloslavskaya, Peter Trifonov

The problem of efficient soft-decision decoding of polar codes with any binary kernel is considered. The proposed approach represents a generalization of the sequential decoding algorithm introduced recently for the case of polar codes with Arikan kernel. Numeric results show that the proposed algorithm enables near-ML decoding of polar codes with BCH kernel.

IEEE Information Theory Workshop (ITW)•Nov 1, 2014•23 citations

Design of binary polar codes with arbitrary kernel

Vera Miloslavskaya, Peter Trifonov

The problem of construction of binary polar codes with high-dimensional kernels is considered. A novel method for computing the erasure probability in the bit subchannels induced by the polarization kernel is proposed. The codes obtained using the proposed method outperform those based on the Arikan kernel.

IEEE Information Theory Workshop (ITW)•Sep 1, 2012•26 citations

Multi-Kernel Construction of Polar Codes

Frédéric Gabry, Valerio Bioglio, Ingmar Land +1 more

We propose a generalized construction for binary polar codes based on mixing multiple kernels of different sizes in order to construct polar codes of block lengths that are not only powers of integers. This results in a multi kernel polar code with very good performance while the encoding complexity remains low and the decoding follows the same general structure as for the original Arikan polar codes. The construction provides numerous practical advantages as more code lengths can be achieved without puncturing or shortening. We observe numerically that the error-rate performance of our construction outperforms stateof the-art constructions using puncturing methods.

arXiv:1612.06099•Dec 19, 2016•0 citations
The directed search algorithm, introduced originally for decoding of polar codes with Arikan kernel, is generalized to the case of a Reed-Solomon kernel. The algorithm relies heavily on the knowledge of symbol subchannel error probabilities of the polarizing transformation. A method to approximate these probabilities is suggested. The proposed method results in almost the same complexity and performance as in the case of the decoder using exact values of error probabilities.
A decoding algorithm for polar (sub)codes with binary 2t×2tpolarization kernels is presented. It is based on the window processing (WP) method, which exploits the linear relationship of the polarization kernels and the Arikan matrix. This relationship enables one to compute the kernel input symbols probabilities by computing the probabilities of several paths in Arikan successive cancellation (SC) decoder. In this paper we propose an improved version of WP, which has significantly lower arithmetic complexity and operates in log-likelihood ratios (LLRs) domain. The algorithm identifies and reuses common subexpressions arising in computation of Arikan SC path scores. The proposed algorithm is applied to kernels of size 16 and 32 with improved polarization properties. It enables polar (sub)codes with the considered kernels to simultaneously provide better performance and lower decoding complexity compared with polar (sub)codes with Arikan kernel.
We propose a generalized construction for binary polar codes based on mixing multiple kernels of different sizes in order to construct polar codes of block lengths that are not only powers of integers. This results in a multi kernel polar code with very good performance while the encoding complexity remains low and the decoding follows the same general structure as for the original Arikan polar codes. The construction provides numerous practical advantages as more code lengths can be achieved without puncturing or shortening. We observe numerically that the error-rate performance of our construction outperforms stateof the-art constructions using puncturing methods.