Results 11 to 20 of about 15,938 (213)
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
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 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
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
Symmetric disjunctive list-decoding codes [PDF]
Designs, Codes and Cryptography, 2015 A binary code is said to be a disjunctive list-decoding $s_L$-code (LD $s_L$-code), $s \ge 2$, $L \ge 1$, if the code is identified by the incidence matrix of a family of finite sets in which the union (or disjunctive sum) of any $s$ sets can cover not more than $L-1$ other sets of the family.
D'yachkov, A. G. +3 more
openaire +4 more sources
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
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
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
On Rational Interpolation-Based List-Decoding and List-Decoding Binary Goppa Codes [PDF]
IEEE Transactions on Information Theory, 2013 To appear in IEEE Transactions of Information ...
Beelen, Peter +3 more
openaire +3 more sources