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 Wireless Communications and Networking Conference Workshops (WCNCW)

Randomized chained polar subcodes

Peter Trifonov

Published Apr 1, 2018• 19 citations
Publisher

Abstract

A generalization of polar subcodes is proposed, which enables a simple construction of codes of arbitrary length. The obtained codes are shown to outperform punctured and shortened polar codes under list/sequential decoding. Furthermore, a simplified Gaussian approximation for polar codes is presented.
DOI
10.1109/wcncw.2018.8369001

Related papers

Design of Polar Subcodes for Permutation Decoding

Mikhail Chernikov, Peter Trifonov

novel construction of randomized polar subcodes and subcodes of extended BCH codes is presented. The proposed approach stems from a new heuristic for building polar code frozen set which minimizes the error probability of successive cancellation algorithm applied to permuted noisy codewords. The frame error rate (FER) of the proposed codes under permutationbased decoding is comparable to FER of existing polar subcodes under successive cancellation list or sequential algorithm.

IEEE Transactions on Communications•Jan 1, 2026•0 citations

Hybrid decoding of interlinked generalized concatenated codes

Kirill Svyatoslavich Ivanov, Peter Trifonov

The problem of efficient decoding of interlinked generalized concatenated codes and polar subcodes is considered. A novel decoding algorithm is proposed, which allows one to significantly reduce the complexity of block sequential decoding of these codes.

International Symposium on Turbo Codes and Iterative Information Processing•Sep 1, 2016•2 citations

Multi-Kernel Construction of Polar Codes

Frédéric Gabry, BIOGLIO V, LAND I +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

•Jan 1, 2017•0 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

Polar-Code Construction of Golay Codes

Valerio Bioglio, Ingmar Land

This letter proposes a reinterpretation of the classical binary Golay codes as Polar codes with additional inner permutations and puncturing. This establishes a novel relationship between algebraic codes and codes based on Kronecker products, like polar codes. Naturally, this construction also allows for polar-code-type decoding of the Golay codes using successive cancellation list decoding. Using the Golay code as a driving example, we conjecture that other algebraic codes may be represented in a similar way.

IEEE Communications Letters•Jan 15, 2018•9 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 state-of-the-art constructions using puncturing methods.

IEEE International Conference on Communications workshops•May 1, 2017•80 citations
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
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.
This letter proposes a reinterpretation of the classical binary Golay codes as Polar codes with additional inner permutations and puncturing. This establishes a novel relationship between algebraic codes and codes based on Kronecker products, like polar codes. Naturally, this construction also allows for polar-code-type decoding of the Golay codes using successive cancellation list decoding. Using the Golay code as a driving example, we conjecture that other algebraic codes may be represented in a similar way.
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 state-of-the-art constructions using puncturing methods.