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

Advances in systems analysis, software engineering, and high performance computing book series

A New Approach to Construction and Decoding of Linear Block Codes Based on Polar Codes

Driss Khebbou, Idriss Chana, Hussain Ben-Azza

Published Dec 29, 2023• 0 citations
Publisher

Abstract

In the field of channel coding theory, there are two main branches. The first is related to the design and construction of codes capable of facilitating identification of errors at the receiver despite potential alterations during transmission; this is known as the encoding operation. The second branch focuses on developing mechanisms for correcting errors caused by the transmission channel, by devising valid and suitable algorithms; this is known as the decoding operation. The authors have delved into both aspects. In the first part, a novel method for constructing good linear codes is studied. It is based on the Hadamard matrix, which shares the same structure as the kernel of polar codes, and on the generator matrix of several existing linear codes. In the second part, a new decoding algorithm is proposed. This involves adapting the SSCL polar code decoder to decode the codes designed in the first part, as well as some of the most well-known block codes.

DOI
10.4018/979-8-3693-0497-6.ch008

Related papers

Properties of Polar Codes

Mohammad Rowshan, Emanuele Viterbo

This chapter delves into the key properties of polar codes, offering insights into their mathematical foundations and practical implications. It examines the polar transform and its connection to linear algebra, highlighting the role of permutation matrices and the construction of generator and parity-check matrices, which are essential for encoding and decoding processes. The chapter also explores the concept of systematic polar codes. It addresses the error correction performance of polar codes through an analysis of their minimum distance and the construction and enumeration of minimum weight codewords. It further extends the discussion to polar codes with large kernels and mixed/multi-kernel constructions, which aim to enhance polarization and improve performance. The chapter introduces the exponent of the polarizing matrix as a measure of the efficiency of these alternative kernels in polarizing sub-channels. It explores the practical aspects of decoding in depth, with a particular focus on the properties of SC decoding.

Wiley eBooks•Oct 27, 2025•0 citations

Convolutional Polar Codes

Andrew J. Ferris, Christoph Hirche, David Poulin

Arikan's Polar codes attracted much attention as the first efficiently decodable and capacity achieving codes. Furthermore, Polar codes exhibit an exponentially decreasing block error probability with an asymptotic error exponent upper bounded by 1/2. Since their discovery, many attempts have been made to improve the error exponent and the finite block-length performance, while keeping the bloc-structured kernel. Recently, two of us introduced a new family of efficiently decodable error-correction codes based on a recently discovered efficiently-contractible tensor network family in quantum many-body physics, called branching MERA. These codes, called branching MERA codes, include Polar codes and also extend them in a non-trivial way by substituting the bloc-structured kernel by a convolutional structure. Here, we perform an in-depth study of a particular example that can be thought of as a direct extension to Arikan's Polar code, which we therefore name Convolutional Polar codes. We prove that these codes polarize and exponentially suppress the channel's error probability, with an asymptotic error exponent log_2(3)/2 which is provably better than for Polar codes under successive cancellation decoding. We also perform finite block-size numerical simulations which display improved error-correcting capability with only a minor impact on decoding complexity.

arXiv:1704.00715•Apr 3, 2017•23 citations

Polar Coding and Linear Decoding

Geraldo A. Barbosa

Polar encoding, described by Arikan in IEEE Transactions on Information Theory, Vol. 55, No. 7, July 2009, was a milestone for telecommunications. A Polar code distributes information among high and low-capacity channels, showing the possibility of achieving perfect channel capacity. The high-capacity channels allow almost noiseless transmission of data. When these channels are not high noise, reliability is achieved in the signal transmission. It starts to compete against codes such a Low-Density Parity-Check (LDPC) codes. Polar code can be also considered error correcting, based on the redundancy inherent in its structure. This feature makes polar encoding also applicable to digital quantum-resistant cryptography protocols. This work explores linear decoding at a first or single trial in the case of small losses or small number of bit-flipping, and repeated transmission for medium level losses. This is distinct from Arikans successive probabilistic decoding by application of probabilistic rules. Linear decoding is done directly from solving the linear equations connecting the codewords x and the received signals y after transmission via noisy channels. Numerical examples will be shown. Along with this work, programming in Mathematica language was used. Codes are available for copy-and-paste for Mathematica users to immediately try the described formalism.

arXiv:2507.19695•Jul 25, 2025•0 citations

Complex Hadamard Codes

Wenping Ma

In this letter, a method to construct good binary and quaternary error correcting codes, called complex Hadamard codes, based on a complex Hadamard matrix is presented. The related properties of the codes are analyzed. Inaddition, through the operation in Z 4 domain, a new simplex soft-decision decoding algorithm for the complex Hadamard codes is also proposed.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2005•8 citations

Deep-Polar Codes: An Efficient Error Correction Code for Short Blocklength Transmission

Geon Choi, Namyoon Lee

In this paper, we put forth a novel class of pre-transformed polar codes, called as “deep-polar codes.” Encoding of deep-polar codes involves a series of multi-layered polar transformations. By applying these successive polar-based pre-transformations, deep-polar codes with an improved weight distribution are constructed with low encoding complexity. We also propose a low-complexity successive cancellation list decoding algorithm to effectively decode the deep-polar codes. This decoding algorithm harnesses the reverse process of the multi-layered pre-transformed encoding, referred to as “back propagation parity checks.” From simulations, we demonstrate that deep-polar codes outperform existing pre-transformed polar codes in terms of block error rates across various code rates and short blocklengths, while maintaining low-complexity encoding and decoding. Our findings highlight the effectiveness and practicality of deep-polar codes for short blocklength transmission scenarios in 6G.

IEEE Globecom Workshops (GC Wkshps)•Dec 4, 2023•6 citations

SIMPLIFIED SUCCESSIVE-CANCELLATION LIST POLAR DECODING FOR BINARY LINEAR BLOCK CODES

Driss Khebbou, Reda Benkhouya, Idriss Chana +1 more

This paper aims to take advantage of the performances of polar decoding techniques for the benefit of binary linear block codes (BLBCs) with the main objective is to study the performances of the SSCL decoding for short-length BLBCs. Polar codes are one of the most recent error-correcting codes to be invented, and they have been mathematically demonstrated to be able to correct all errors under a specific situation, using the successive-cancellation decoder. However, their performances for real-time wireless communications at short block lengths remain less attractive. To take advantage of the performance of these codes in favor of error correction codes of short block length, an adaptation of the simplified successive-cancellation list as a decoder for polar codes for the benefit of short block length binary linear block codes is presented in this paper. This adaptation makes it possible to take advantage of the performances of less complex decoding methods for polar codes for BLBCs with latency and complexity optimization of the standard successive-cancellation list decoder. The experiment shows that the method can achieve the performances of the most famous order statistic decoder for binary linear block codes, which can achieve the performances of maximum-likelihood decoding with computational complexity and memory constraints.

Journal of Southwest Jiaotong University•Dec 24, 2021•3 citations
In the field of channel coding theory, there are two main branches. The first is related to the design and construction of codes capable of facilitating identification of errors at the receiver despite potential alterations during transmission; this is known as the encoding operation. The second branch focuses on developing mechanisms for correcting errors caused by the transmission channel, by devising valid and suitable algorithms; this is known as the decoding operation. The authors have delved into both aspects. In the first part, a novel method for constructing good linear codes is studied. It is based on the Hadamard matrix, which shares the same structure as the kernel of polar codes, and on the generator matrix of several existing linear codes. In the second part, a new decoding algorithm is proposed. This involves adapting the SSCL polar code decoder to decode the codes designed in the first part, as well as some of the most well-known block codes.
This chapter delves into the key properties of polar codes, offering insights into their mathematical foundations and practical implications. It examines the polar transform and its connection to linear algebra, highlighting the role of permutation matrices and the construction of generator and parity-check matrices, which are essential for encoding and decoding processes. The chapter also explores the concept of systematic polar codes. It addresses the error correction performance of polar codes through an analysis of their minimum distance and the construction and enumeration of minimum weight codewords. It further extends the discussion to polar codes with large kernels and mixed/multi-kernel constructions, which aim to enhance polarization and improve performance. The chapter introduces the exponent of the polarizing matrix as a measure of the efficiency of these alternative kernels in polarizing sub-channels. It explores the practical aspects of decoding in depth, with a particular focus on the properties of SC decoding.
Arikan's Polar codes attracted much attention as the first efficiently decodable and capacity achieving codes. Furthermore, Polar codes exhibit an exponentially decreasing block error probability with an asymptotic error exponent upper bounded by 1/2. Since their discovery, many attempts have been made to improve the error exponent and the finite block-length performance, while keeping the bloc-structured kernel. Recently, two of us introduced a new family of efficiently decodable error-correction codes based on a recently discovered efficiently-contractible tensor network family in quantum many-body physics, called branching MERA. These codes, called branching MERA codes, include Polar codes and also extend them in a non-trivial way by substituting the bloc-structured kernel by a convolutional structure. Here, we perform an in-depth study of a particular example that can be thought of as a direct extension to Arikan's Polar code, which we therefore name Convolutional Polar codes. We prove that these codes polarize and exponentially suppress the channel's error probability, with an asymptotic error exponent log_2(3)/2 which is provably better than for Polar codes under successive cancellation decoding. We also perform finite block-size numerical simulations which display improved error-correcting capability with only a minor impact on decoding complexity.
Polar encoding, described by Arikan in IEEE Transactions on Information Theory, Vol. 55, No. 7, July 2009, was a milestone for telecommunications. A Polar code distributes information among high and low-capacity channels, showing the possibility of achieving perfect channel capacity. The high-capacity channels allow almost noiseless transmission of data. When these channels are not high noise, reliability is achieved in the signal transmission. It starts to compete against codes such a Low-Density Parity-Check (LDPC) codes. Polar code can be also considered error correcting, based on the redundancy inherent in its structure. This feature makes polar encoding also applicable to digital quantum-resistant cryptography protocols. This work explores linear decoding at a first or single trial in the case of small losses or small number of bit-flipping, and repeated transmission for medium level losses. This is distinct from Arikans successive probabilistic decoding by application of probabilistic rules. Linear decoding is done directly from solving the linear equations connecting the codewords x and the received signals y after transmission via noisy channels. Numerical examples will be shown. Along with this work, programming in Mathematica language was used. Codes are available for copy-and-paste for Mathematica users to immediately try the described formalism.
In this paper, we put forth a novel class of pre-transformed polar codes, called as “deep-polar codes.” Encoding of deep-polar codes involves a series of multi-layered polar transformations. By applying these successive polar-based pre-transformations, deep-polar codes with an improved weight distribution are constructed with low encoding complexity. We also propose a low-complexity successive cancellation list decoding algorithm to effectively decode the deep-polar codes. This decoding algorithm harnesses the reverse process of the multi-layered pre-transformed encoding, referred to as “back propagation parity checks.” From simulations, we demonstrate that deep-polar codes outperform existing pre-transformed polar codes in terms of block error rates across various code rates and short blocklengths, while maintaining low-complexity encoding and decoding. Our findings highlight the effectiveness and practicality of deep-polar codes for short blocklength transmission scenarios in 6G.
This paper aims to take advantage of the performances of polar decoding techniques for the benefit of binary linear block codes (BLBCs) with the main objective is to study the performances of the SSCL decoding for short-length BLBCs. Polar codes are one of the most recent error-correcting codes to be invented, and they have been mathematically demonstrated to be able to correct all errors under a specific situation, using the successive-cancellation decoder. However, their performances for real-time wireless communications at short block lengths remain less attractive. To take advantage of the performance of these codes in favor of error correction codes of short block length, an adaptation of the simplified successive-cancellation list as a decoder for polar codes for the benefit of short block length binary linear block codes is presented in this paper. This adaptation makes it possible to take advantage of the performances of less complex decoding methods for polar codes for BLBCs with latency and complexity optimization of the standard successive-cancellation list decoder. The experiment shows that the method can achieve the performances of the most famous order statistic decoder for binary linear block codes, which can achieve the performances of maximum-likelihood decoding with computational complexity and memory constraints.