Results 21 to 30 of about 178,221 (275)
List decodability at small radii [PDF]
Designs, Codes and Cryptography, 2010 to appear in Designs, Codes, and Cryptography (accepted October 2010)
Yeow Meng Chee +4 more
openaire +4 more sources
CRC-Aided Adaptive BP Decoding of PAC Codes
Entropy, 2022 Although long polar codes with successive cancellation decoding can asymptotically achieve channel capacity, the performance of short blocklength polar codes is far from optimal.
Xianwen Zhang +4 more
doaj +1 more source
A New List Decoding Algorithm for Short-Length TBCCs With CRC
IEEE Access, 2018 In this paper, a new list decoding algorithm for tail-biting convolutional codes (TBCCs) with a cyclic redundancy check (CRC) is proposed, where the CRC is considered as a concatenated outer code.
Jae-Won Kim +3 more
doaj +1 more source
The decoding Library for list decoding [PDF]
ACM Communications in Computer Algebra, 2013 The decoding library is a C library whose main goal is to implement as effi- ciently as possible the Guruswami-Sudan algorithm. It is written in C89 and is stand-alone.
openaire +2 more sources
IEEE Access, 2020 As the fifth-generation (5G) wireless networks' key technology, the joint design of SCMA and polar code is concerned by the future communication system. In this paper, a CRC aided joint iterative detection and successive cancellation list (SCL) decoding (
Xi Wu, Yafeng Wang, Chuanfeng Li
doaj +1 more source
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
ACM SIGACT News, 2000 Over the years coding theory and complexity theory have benefited from a number of mutually enriching connections. This article focuses on a new connection that has emerged between the two topics in the recent years. This connection is centered around the notion of “list-decoding” for error-correcting codes. In this survey we describe the list-decoding
openaire +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.
Ron M. Roth, Pascal O. Vontobel
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
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