Abstract | ||
---|---|---|
The main computational steps in algebraic soft-decoding, as well as Sudan-type list-decoding, of Reed-Solomon codes are bivariate polynomial interpolation and factorization. We introduce a computational technique, based upon re-encoding and coordinate transformation, that significantly reduces the complexity of the bivariate interpolation procedure. This re-encoding and coordinate transformation converts the original interpolation problem into another reduced interpolation problem, which is orders of magnitude smaller than the original one. A formal proof is presented to show that the two interpolation problems are indeed equivalent. An efficient factorization procedure that applies directly to the reduced interpolation problem is also given. |
Year | DOI | Venue |
---|---|---|
2011 | 10.1109/TIT.2010.2096034 | IEEE Transactions on Information Theory |
Keywords | DocType | Volume |
coordinate transformation,reed solomon code,list decoding,information theory,polynomial interpolation | Journal | 57 |
Issue | ISSN | Citations |
2 | 0018-9448 | 23 |
PageRank | References | Authors |
1.10 | 11 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ralf Koettery | 1 | 5019 | 456.62 |
Jun Ma | 2 | 93 | 9.42 |
A. Vardy | 3 | 711 | 76.84 |