English
Related papers

Related papers: Rate-Compatible Polar Codes for Automorphism Ensem…

200 papers

In this paper, we propose a data-driven algorithm to design rate- and length-flexible polar codes. While the algorithm is very general, a particularly appealing use case is the design of codes for automorphism ensemble decoding (AED), a…

Information Theory · Computer Science 2025-10-08 Marvin Rübenacke , Andreas Zunker , Felix Krieg , Stephan ten Brink

The URLLC scenario in the upcoming 6G standard requires low latency and ultra reliable transmission, i.e., error correction towards ML performance. Achieving near-ML performance is very challenging especially for short block lengths. Polar…

Information Theory · Computer Science 2023-03-03 Claus Kestel , Marvin Geiselhart , Lucas Johannsen , Stephan ten Brink , Norbert Wehn

In the short block length regime, pre-transformed polar codes together with successive cancellation list (SCL) decoding possess excellent error correction capabilities. However, in practice, the list size is limited due to the suboptimal…

Information Theory · Computer Science 2025-04-25 Henning Lulei , Jonathan Mandelbaum , Marvin Rübenacke , Holger Jäkel , Stephan ten Brink , Laurent Schmalen

The discovery of suitable automorphisms of polar codes gained a lot of attention by applying them in Automorphism Ensemble Decoding (AED) to improve the error-correction performance, especially for short block lengths. This paper introduces…

Information Theory · Computer Science 2023-06-29 Lucas Johannsen , Claus Kestel , Marvin Geiselhart , Timo Vogt , Stephan ten Brink , Norbert Wehn

In this paper we deal with polar code automorphisms that are beneficial under low-latency automorphism ensemble (AE) decoding, and we propose polar code designs that have such automorphisms. Successive-cancellation (SC) decoding and thus…

Information Theory · Computer Science 2021-09-06 Charles Pillet , Valerio Bioglio , Ingmar Land

In this paper, we propose a low-latency decoding solution of shortened polar codes based on their automorphism groups. The automorphism group of shortened polar codes, designed according to two existing shortening patterns, are shown to be…

Information Theory · Computer Science 2024-03-04 Charles Pillet , Ilshat Sagitov , Valerio Bioglio , Pascal Giard

Physical unclonable functions (PUFs) involve challenging practical applications of error-correcting codes (ECCs), requiring extremely low failure rates on the order of $10^{-6}$ and below despite raw input bit error rates as high as 22%.…

Information Theory · Computer Science 2025-10-13 Marvin Rübenacke , Sebastian Cammerer , Michael Sullivan , Alexander Keller

This paper proposes new polar code design principles for the low-latency automorphism ensemble (AE) decoding. Our proposal permits to design a polar code with the desired automorphism group (if possible) while assuring the decreasing…

Information Theory · Computer Science 2021-10-28 Charles Pillet , Valerio Bioglio , Ingmar Land

Over the past years, Polar codes have arisen as a highly effective class of linear codes, equipped with a decoding algorithm of low computational complexity. This family of codes share a common algebraic formalism with the well-known…

Combinatorics · Mathematics 2024-06-17 Jicheng Ma , Guiying Yan

Automorphism ensemble (AE) decoding for polar codes was proposed by decoding permuted codewords with successive cancellation (SC) decoders in parallel and hence has lower latency compared to that of successive cancellation list (SCL)…

Information Theory · Computer Science 2022-06-24 Zicheng Ye , Yuan Li , Huazi Zhang , Rong Li , Jun Wang , Guiying Yan , Zhiming Ma

Polar codes are a class of capacity-achieving error correcting codes that have been selected for use in enhanced mobile broadband in the 3GPP 5th generation (5G) wireless standard. Most polar code research examines the original Arikan polar…

Information Theory · Computer Science 2019-07-17 Adam Cavatassi , Thibaud Tonnellier , Warren J. Gross

In this paper, we propose an analysis of the automorphism group of polar codes, with the scope of designing codes tailored for automorphism ensemble (AE) decoding. We prove the equivalence between the notion of decreasing monomial codes and…

Information Theory · Computer Science 2022-06-08 Valerio Bioglio , Ingmar Land , Charles Pillet

Automorphism Ensemble (AE) decoding has recently drawn attention as a possible alternative to list decoding of polar codes. In this letter, we investigate the distribution of Partially-Symmetric Reed-Muller (PS-RM) codes, a family of polar…

Information Theory · Computer Science 2023-08-07 Charles Pillet , Valerio Bioglio , Pascal Giard

We present a method of constructing rate-compatible polar codes that are capacity-achieving with low-complexity sequential decoders. The proposed code construction allows for incremental retransmissions at different rates in order to adapt…

Information Theory · Computer Science 2016-01-29 Song-Nam Hong , Dennis Hui , Ivana Marić

Polar codes are capacity achieving error correcting codes that can be decoded through the successive-cancellation algorithm. To improve its error-correction performance, a list-based version called successive-cancellation list (SCL) has…

Information Theory · Computer Science 2017-01-30 Seyyed Ali Hashemi , Carlo Condo , Warren J. Gross

Precoded polar product codes are proposed, where selected component codes enable successive cancellation list decoding to generate bit-wise soft messages efficiently for iterative decoding while targeting optimized distance spectrum as…

Information Theory · Computer Science 2024-02-13 Mustafa Cemil Coşkun

Typically, forward error correction (FEC) codes are designed based on the minimization of the error rate for a given code rate. However, for applications that incorporate hybrid automatic repeat request (HARQ) protocol and adaptive…

Information Theory · Computer Science 2018-11-07 Hossein Khoshnevis , Ian Marsland , Halim Yanikomeroglu

Polar codes have gained significant amount of attention during the past few years and have been selected as a coding scheme for the next generation of mobile broadband standard. Among decoding schemes, successive-cancellation list (SCL)…

Information Theory · Computer Science 2017-08-31 Seyyed Ali Hashemi , Carlo Condo , Warren J. Gross

A heuristic construction of polar codes for successive cancellation list (SCL) decoding with a given list size is proposed to balance the trade-off between performance measured in frame error rate (FER) and decoding complexity. Furthermore,…

Information Theory · Computer Science 2018-08-03 Peihong Yuan , Tobias Prinz , Georg Böcherer , Onurcan İşcan , Ronald Böhnke , Wen Xu

In this paper, a low-complexity approach for the automorphism ensemble decoder (AED) using successive cancellation (SC) as constituent decoders is proposed. The approach sequentially activates sub-decoders and terminates the decoding…

Information Theory · Computer Science 2026-05-21 Charles Pillet , Pascal Giard , Bassant Selim , François Leduc-Primeau
‹ Prev 1 2 3 10 Next ›