Sciweavers

706 search results - page 7 / 142
» List Decoding: Algorithms and Applications
Sort
View
FOCS
2002
IEEE
14 years 15 days 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
FPGA
2006
ACM
195views FPGA» more  FPGA 2006»
13 years 11 months ago
An adaptive Reed-Solomon errors-and-erasures decoder
The development of Reed-Solomon (RS) codes has allowed for improved data transmission over a variety of communication media. Although Reed-Solomon decoding provides a powerful def...
Lilian Atieno, Jonathan Allen, Dennis Goeckel, Rus...
VTC
2006
IEEE
100views Communications» more  VTC 2006»
14 years 1 months ago
List Stack Detection with Reduced Search Space for MIMO Communication Systems
The interest in near-ML detection algorithms for Multiple-Input/lMultiple-Output (MIMO) systems have always been high due to their drastic performance gain over suboptimal algorith...
Woon Hau Chin, Sumei Sun
DCC
2010
IEEE
13 years 2 months ago
Parameter choices and a better bound on the list size in the Guruswami-Sudan algorithm for algebraic geometry codes
Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
Nathan Drake, Gretchen L. Matthews
ALGORITHMICA
1998
75views more  ALGORITHMICA 1998»
13 years 7 months ago
Average Case Analyses of List Update Algorithms, with Applications to Data Compression
We study the performance of the Timestamp(0) (TS(0)) algorithm for self-organizing sequential search on discrete memoryless sources. We demonstrate that TS(0) is better than Move-...
Susanne Albers, Michael Mitzenmacher