8 search results - page 1 / 2 » Complexity of Decoding Positive-Rate Reed-Solomon Codes |
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
IMA
1999
Springer
14 years 3 months ago
1999
Springer
Abstract. In this paper we introduce three soft-decision decoding algorithms for Reed-Solomon (RS) codes. We compare them in terms of performance over both the AWGN and Rayleigh Fa...
ICCD
2006
IEEE
14 years 7 months ago
2006
IEEE
Reed-Solomon (RS) codes are among the most widely utilized error-correcting codes in modern communication and computer systems. Among the decoding algorithms of RS codes, the rece...
ICCCN
2007
IEEE
14 years 5 months ago
2007
IEEE
—For real-time wireless communications, short forward error-correcting (FEC) codes are indispensable due to the strict delay requirement. In this paper we study the performance o...
JSAC
2010
13 years 5 months ago
2010
In this paper, we present a generalization of the ordered statistics decoding (OSD) techniques for the class of intersymbol interference (ISI) channels, and show decoding results f...