412 search results - page 8 / 83 » New Set of Codes for the Maximum-Likelihood Decoding Problem |
FOCS
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
FFA
2006
14 years 9 months ago
2006
We determine information sets for the generalized Reed-Muller codes and use these to apply partial permutation decoding to codes from finite geometries over prime fields. We also ...
80
Voted
DCC
2004
IEEE
15 years 9 months ago
2004
IEEE
We introduce three new innovations for compression using LDPCs for the Slepian-Wolf problem. The first is a general iterative Slepian-Wolf decoding algorithm that incorporates the...
87
Voted
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract--A hybrid MPI/Pthreads parallelization was implemented in the RAxML phylogenetics code. New MPI code was added to the existing Pthreads production code to exploit parallel...
ECCC
2010
14 years 9 months ago
2010
Locally decodable codes are error-correcting codes that admit efficient decoding algorithms; any bit of the original message can be recovered by looking at only a small number of ...