Results 21 to 30 of about 177,188 (278)
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, Noga Ron-Zewi
openaire +2 more sources
List Decoding with Double Samplers [PDF]
SIAM Journal on Computing, 2019 We strengthen the notion of "double samplers", first introduced by Dinur and Kaufman [Proc. 58th FOCS, 2017], which are samplers with additional combinatorial properties, and whose existence we prove using high dimensional expanders. The ABNNR code construction [IEEE Trans. Inform.
Dinur, Irit +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
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
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
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
List Decoding of Matrix-Product Codes from nested codes: an application to Quasi-Cyclic codes [PDF]
, 2012 A list decoding algorithm for matrix-product codes is provided when $C_1,..., C_s$ are nested linear codes and $A$ is a non-singular by columns matrix. We estimate the probability of getting more than one codeword as output when the constituent codes are
F. Hernando +15 more
core +5 more sources
List decodability at small radii [PDF]
Designs, Codes and Cryptography, 2010 to appear in Designs, Codes, and Cryptography (accepted October 2010)
Chee, Yeow Meng +4 more
openaire +4 more sources