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 Turbo Codes and Iterative Information Processing

Hybrid decoding of interlinked generalized concatenated codes

Kirill Svyatoslavich Ivanov, Peter Trifonov

Published Sep 1, 2016• 2 citations
Publisher

Abstract

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.
DOI
10.1109/istc.2016.7593073

Related papers

Randomized chained polar subcodes

Peter Trifonov

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.

IEEE Wireless Communications and Networking Conference Workshops (WCNCW)•Apr 1, 2018•19 citations

Reduced GMD decoding of concatenated codes

Jos H. Weber, Khaled Abdel-Ghaffar

We present a general version of the generalized minimum distance (GMD) decoding algorithm (see Forney, G.D., Jr, 1966) that accommodates different erasing strategies. This version is called reduced GMD decoding since, depending on the erasing strategy used, it can offer a reduction in complexity over Forney's GMD decoding. We apply reduced GMD decoding to concatenated codes. In particular, we study the error correction capability and the unsuccessful decoding probability of concatenated codes with reduced GMD decoding.

Globecom•Nov 13, 2002•0 citations

Sequential Decoding of Polar Codes

V. Miloslavkaya, Peter Trifonov

The problem of efficient decoding of polar codes is considered. A low-complexity sequential soft decision decoding algorithm is proposed. It is based on the successive cancellation approach, and it employs most likely codeword probability estimates for selection of a path within the code tree to be extended.

IEEE Communications Letters•May 13, 2014•81 citations

Sequential Decoding of Polar Codes

Vera Miloslavskaya, Peter Trifonov

The problem of efficient decoding of polar codes is considered. A low-complexity sequential soft decision decoding algorithm is proposed. It is based on the successive cancellation approach, and it employs most likely codeword probability estimates for selection of a path within the code tree to be extended.

•Jul 1, 2014•0 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

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
We present a general version of the generalized minimum distance (GMD) decoding algorithm (see Forney, G.D., Jr, 1966) that accommodates different erasing strategies. This version is called reduced GMD decoding since, depending on the erasing strategy used, it can offer a reduction in complexity over Forney's GMD decoding. We apply reduced GMD decoding to concatenated codes. In particular, we study the error correction capability and the unsuccessful decoding probability of concatenated codes with reduced GMD decoding.
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.