Sciweavers

91 search results - page 3 / 19
» Some Soft-Decision Decoding Algorithms for Reed-Solomon Code...
Sort
View
CORR
2004
Springer
111views Education» more  CORR 2004»
13 years 5 months ago
Maximum-likelihood decoding of Reed-Solomon Codes is NP-hard
Maximum-likelihood decoding is one of the central algorithmic problems in coding theory. It has been known for over 25 years that maximum-likelihood decoding of general linear cod...
Venkatesan Guruswami, Alexander Vardy
ICC
2007
IEEE
127views Communications» more  ICC 2007»
13 years 11 months ago
Efficient Factorisation Algorithm for List Decoding Algebraic-Geometric and Reed-Solomon Codes
— The list decoding algorithm can outperform the conventional unique decoding algorithm by producing a list of candidate decoded messages. An efficient list decoding algorithm fo...
L. Chen, Rolando A. Carrasco, Martin Johnston, E. ...
JSAC
2006
85views more  JSAC 2006»
13 years 5 months ago
Iterative algebraic soft-decision list decoding of Reed-Solomon codes
In this paper, we present an iterative soft-decision decoding algorithm for Reed
Mostafa El-Khamy, Robert J. McEliece
FOCS
2002
IEEE
13 years 10 months ago
Linear Diophantine Equations over Polynomials and Soft Decoding of Reed-Solomon Codes
Abstract—This paper generalizes the classical Knuth–Schönhage algorithm computing the greatest common divisor (gcd) of two polynomials for solving arbitrary linear Diophantine...
Michael Alekhnovich
FFA
2008
76views more  FFA 2008»
13 years 5 months ago
On the subset sum problem over finite fields
Abstract. The subset sum problem over finite fields is a well known NPcomplete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study th...
Jiyou Li, Daqing Wan