Results 31 to 40 of about 177,188 (278)
Lattice (List) Decoding Near Minkowski’s Inequality [PDF]
IEEE Transactions on Information Theory, 2022 14 pages, 2 ...
Ethan Mook, Chris Peikert
openaire +2 more sources
List decoding of polar codes [PDF]
2011 IEEE International Symposium on Information Theory Proceedings, 2011 We describe a successive-cancellation \emph{list} decoder for polar codes, which is a generalization of the classic successive-cancellation decoder of Ar kan. In the proposed list decoder, up to $L$ decoding paths are considered concurrently at each decoding stage. Then, a single codeword is selected from the list as output.
Tal, Ido, Vardy, Alexander
openaire +2 more sources
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
Almost disjunctive list-decoding codes [PDF]
Problems of Information Transmission, 2015 A binary code is said to be a disjunctive list-decoding $s_L$-code, $s\ge1$, $L\ge1$, (briefly, LD $s_L$-code) if the code is identified by the incidence matrix of a family of finite sets in which the union of any $s$ sets can cover not more than $L-1$ other sets of the family. In this paper, we introduce a natural {\em probabilistic} generalization of
D'yachkov, A. G. +3 more
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
Linear-algebraic list decoding of folded Reed-Solomon codes [PDF]
, 2011 Folded Reed-Solomon codes are an explicit family of codes that achieve the optimal trade-off between rate and error-correction capability: specifically, for any $\eps > 0$, the author and Rudra (2006,08) presented an $n^{O(1/\eps)}$ time algorithm to ...
Guruswami, Venkatesan
core +2 more sources
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
List decoding of burst errors [PDF]
2008 IEEE International Symposium on Information Theory, 2008 A generalization of the Reiger bound is presented for the list decoding of burst errors. It is then shown that Reed-Solomon codes attain this bound.
Roth, Ron M., Vontobel, Pascal O.
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