Sciweavers

12 search results - page 2 / 3
» Iterative algebraic soft-decision list decoding of Reed-Solo...
Sort
View
FOCS
2002
IEEE
13 years 9 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
STOC
2009
ACM
187views Algorithms» more  STOC 2009»
14 years 5 months ago
Artin automorphisms, cyclotomic function fields, and folded list-decodable codes
Algebraic codes that achieve list decoding capacity were recently constructed by a careful "folding" of the Reed-Solomon code. The "low-degree" nature of this f...
Venkatesan Guruswami
ICCCN
2007
IEEE
13 years 11 months ago
On Short Forward Error-Correcting Codes for Wireless Communication Systems
—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...
Sheng Tong, Dengsheng Lin, Aleksandar Kavcic, Baom...
CORR
2010
Springer
131views Education» more  CORR 2010»
13 years 3 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger
TCOM
2008
155views more  TCOM 2008»
13 years 4 months ago
Construction of nonbinary cyclic, quasi-cyclic and regular LDPC codes: a finite geometry approach
This paper presents five methods for constructing nonbinary LDPC codes based on finite geometries. These methods result in five classes of nonbinary LDPC codes, one class of cyclic...
Lingqi Zeng, Lan Lan, Ying Yu Tai, Bo Zhou, Shu Li...