Results 41 to 50 of about 19,174 (291)
Higher-Order Belief Propagation Correction Decoder for Polar Codes
Entropy, 2022 Belief propagation (BP) decoding for polar codes has been extensively studied because of its inherent parallelism. However, its performance remains inferior to that of successive cancellation list decoding (SCL) due to the structure of the decoding graph.
Meng Zhang +3 more
doaj +1 more source
A Low-latency Successive Cancellation List Decoding Algorithm for Polar Codes [PDF]
Jisuanji gongcheng, 2018 In order to further reduce the decoding delay,a low-latency adaptive Successive Cancellation List(SCL) decoding algorithm based on path reuse is proposed.A repeated path replicating scheme based on CRC check is adopted for the phenomenon that there is a ...
LIU Yajun,LI Shibao,LIU Jianhang,CHEN Haihua
doaj +1 more source
SC List-Flip Decoding of Polar Codes by Shifted Pruning: A General Approach
Entropy, 2022 In the successive cancellation (SC) list decoding, the tree pruning operation retains the L best paths with respect to a metric at every decoding step. However, the correct path might be among the L worst paths due to the imposed penalties. In this case,
Mohammad Rowshan, Emanuele Viterbo
doaj +1 more source
Two Theorems on List Decoding [PDF]
, 2010 We prove the following results concerning the list decoding of error-correcting codes: (i) We show that for \textit{any} code with a relative distance of $δ$ (over a large enough alphabet), the following result holds for \textit{random errors}: With high probability, for a $ρ\le δ-\eps$ fraction of random errors (for any $\eps>0$), the received word
Atri Rudra, Steve Uurtamo
openaire +3 more sources
Efficient list-decoding with constant alphabet and list sizes [PDF]
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021 We present an explicit and efficient algebraic construction of capacity-achieving list decodable codes with both constant alphabet and constant list sizes. More specifically, for any $R \in (0,1)$ and $ε>0$, we give an algebraic construction of an infinite family of error-correcting codes of rate $R$, over an alphabet of size $(1/ε)^{O(1/ε^2 ...
Zeyu Guo 0001, Noga Ron-Zewi
openaire +3 more sources
In Situ Multi-Bit Decision for Successive Cancellation List Decoding of Polar Codes
IEEE Access, 2022 Polar codes are the first capacity-achieving error-correction code which has attracted much research attention. Among many decoding methods, successive cancellation list decoding (SCLD) is considered as a representative decoding method that can achieve a
Jaehyeon Park +2 more
doaj +1 more source
Behavioral Models for List Decoding [PDF]
Mathematical and Computer Modelling of Dynamical Systems, 2002 Recently it has been shown that list decoding of Reed-Solomon codes may be translated into a bivariate interpolation problem. The data consist of pairs in a finite field and the aim is to find a bivariate polynomial that interpolates the given pairs and is minimal with respect to some criterion.
Kuijper, M., Polderman, Jan W.
openaire +2 more sources
An Improved Bit-Flipping Algorithm of Successive Cancellation List Decoding for Polar Codes
Mathematics, 2023 Polar codes, as the coding scheme for the control channel in fifth-generation mobile communication technology (5G), have attracted widespread attention since their proposal.
Desheng Wang +5 more
doaj +1 more source
On the List Decodability of Insertions and Deletions [PDF]
IEEE Transactions on Information Theory, 2018 In this work, we study the problem of list decoding of insertions and deletions. We present a Johnson-type upper bound on the maximum list size. The bound is meaningful only when insertions occur. Our bound implies that there are binary codes of rate $Ω(1)$ that are list-decodable from a $0.707$-fraction of insertions. For any $τ_\mathsf{I} \geq 0$ and
Tomohiro Hayashi, Kenji Yasunaga
openaire +3 more sources
Tailored List Decoding of Polar Codes
, 2021 International audienceIn this paper, we provide some experimental evidence that a significant number of metric updates and sorting can be avoided during list decoding of polar codes.
Jégo, Christophe +9 more
core +1 more source