Sciweavers

2 search results - page 1 / 1
» Waterfilling-Like Multiplicity Assignment Algorithm for Alge...
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