English
Related papers

Related papers: Adjacent-Bits-Swapped Polar codes: A new code cons…

200 papers

A method for efficiently constructing polar codes is presented and analyzed. Although polar codes are explicitly defined, straightforward construction is intractable since the resulting polar bit-channels have an output alphabet that grows…

Information Theory · Computer Science 2013-04-11 Ido Tal , Alexander Vardy

Polar codes are a class of linear error correction codes which provably attain channel capacity with infinite codeword lengths. Finite length polar codes have been adopted into the 5th Generation 3GPP standard for New Radio, though their…

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

Polar codes are the first class of structured channel codes that achieve the symmetric capacity of binary channels with efficient encoding and decoding. In 2019, Arikan proposed a new polar coding scheme referred to as polarization-adjusted…

Information Theory · Computer Science 2024-01-30 Hamid Saber , Homayoon Hatami , Jung Hyun Bae

Polar codes are an exciting new class of error correcting codes that achieve the symmetric capacity of memoryless channels. Many decoding algorithms were developed and implemented, addressing various application requirements: from…

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

In this paper, we introduce a new coding and decoding structure for enhancing the reliability and performance of polar codes, specifically at low error rates. We achieve this by concatenating two polar codes in series to create robust…

Information Theory · Computer Science 2023-11-07 Mohammed Mensouri , Mustapha Eddahibi

A reduced complexity sequential decoding algorithm for polar (sub)codes is described. The proposed approach relies on a decomposition of the polar (sub)code being decoded into a number of outer codes, and on-demand construction of codewords…

Information Theory · Computer Science 2020-07-08 Grigorii Trofimiuk , Nikolay Iakuba , Stanislav Rets , Kirill Ivanov , Peter Trifonov

Polar codes are a family of capacity-achieving error-correcting codes, and they have been selected as part of the next generation wireless communication standard. Each polar code bit-channel is assigned a reliability value, used to…

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

Tailoring polar code construction for decoding algorithms beyond successive cancellation has remained a topic of significant interest in the field. However, despite the inherent nested structure of polar codes, the use of sequence models in…

Information Theory · Computer Science 2024-01-31 Sravan Kumar Ankireddy , S Ashwin Hebbar , Heping Wan , Joonyoung Cho , Charlie Zhang

Polar codes are widely used in modern communication systems due to their capacity-achieving properties. This paper investigates the importance of coded bits in the decoding process of polar codes and aims to determine which bits contribute…

Information Theory · Computer Science 2025-07-14 Hossam Hassan , Ali Gaber , Mohammed Karmoose , Noha Korany

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

Deep polar codes are pre-transformed polar codes that employ a multi-layered polar kernel transformation strategy to enhance code performance in short blocklength regimes. However, like conventional polar codes, their block length is…

Information Theory · Computer Science 2025-05-13 Geon Choi , Namyoon Lee

Polar codes are a new class of capacity-achieving error-correcting codes with low encoding and decoding complexity. Their low-complexity decoding algorithms rendering them attractive for use in software-defined radio applications where…

Information Theory · Computer Science 2016-07-12 Pascal Giard , Gabi Sarkis , Camille Leroux , Claude Thibeault , 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

A novel structure of polar codes is proposed for finite-state modulation (FSM), in order to improve polarization under it, and approach the polarization efficiency that conventional polar codes achieve under memoryless channels. We choose a…

Information Theory · Computer Science 2025-07-08 Yinuo Mei , Yangyong Zhang , Daiming Qu

Fast SC decoding overcomes the latency caused by the serial nature of the SC decoding by identifying new nodes in the upper levels of the SC decoding tree and implementing their fast parallel decoders. In this work, we first present a novel…

Polar codes have been gaining a lot of interest due to it being the first coding scheme to provably achieve the symmetric capacity of a binary memoryless channel with an explicit construction. However, the main drawback of polar codes is…

Information Theory · Computer Science 2019-11-11 Heshani Gamage , Vismika Ranasinghe , Nandana Rajatheva , Matti Latva-aho

Polar codes have received increasing attention in the past decade, and have been selected for the next generation of wireless communication standard. Most research on polar codes has focused on codes constructed from a $2\times2$…

Hardware Architecture · Computer Science 2018-02-05 Gabriele Coppolino , Carlo Condo , Guido Masera , Warren J. Gross

The problem of polar coding for an arbitrary sequence of independent binary-input memoryless symmetric (BMS) channels $\left\{W_i\right\}_{i=1}^{N}$ is considered. The sequence of channels is assumed to be completely known to both the…

Information Theory · Computer Science 2020-08-27 Hessam Mahdavifar

A practical rate-matching system for constructing rate-compatible polar codes is proposed. The proposed polar code circular buffer rate-matching is suitable for transmissions on communication channels that support hybrid automatic repeat…

Information Theory · Computer Science 2017-11-15 Mostafa El-Khamy , Hsien-Ping Lin , Jungwon Lee , Inyup Kang