Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Pillet, Charles"'
Polar codes are a class of error-correcting codes that provably achieve the capacity of practical channels under the low-complexity successive-cancellation flip (SCF) decoding algorithm. However, the SCF decoding algorithm has a variable execution ti
Externí odkaz:
http://arxiv.org/abs/2409.03051
The recently proposed Successive-Cancellation List Flip (SCLF) decoding algorithm for polar codes improves the error-correcting performance of state-of-the-art SC List (SCL) decoding. However, it comes at the cost of a higher complexity. In this pape
Externí odkaz:
http://arxiv.org/abs/2409.00266
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 limited bu
Externí odkaz:
http://arxiv.org/abs/2403.00622
Publikováno v:
IEEE Communications Letters ( Volume: 27, Issue: 2, February 2023) - Pages: 497 - 501
In this letter, we propose to add dynamic frozen bits to underlying polar codes with a Reed-Muller information set with the aim of maintaining the same sub-decoding structure in Automorphism Ensemble (AE) and lowering the Maximum Likelihood (ML) boun
Externí odkaz:
http://arxiv.org/abs/2303.11185
Polar codes are a class of error-correcting codes that provably achieve the capacity of practical channels. The successive-cancellation flip (SCF) decoder is a low-complexity decoder that was proposed to improve the performance of the successive-canc
Externí odkaz:
http://arxiv.org/abs/2303.01561
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 the unive
Externí odkaz:
http://arxiv.org/abs/2206.03342
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 codes yiel
Externí odkaz:
http://arxiv.org/abs/2205.04338
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 monomial propert
Externí odkaz:
http://arxiv.org/abs/2110.14438
In this work we propose an encoding and decoding framework for staircase codes based on non-systematic polar codes as component codes. The staircase structure allows for efficient parallelized decoding, while the polar component codes allow to benefi
Externí odkaz:
http://arxiv.org/abs/2105.09104
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 SC-based AE
Externí odkaz:
http://arxiv.org/abs/2102.08250