| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 401342 | Journal of Symbolic Computation | 2009 | 5 Pages |
Abstract
An account of the interpolation and the root-finding steps of list decoding of one-point codes is given. The interpolation step is reduced to the problem of finding the minimal element of the Gröbner basis of a submodule of a free module over a polynomial ring of one variable. The procedure for root-finding of the interpolation polynomial going modulo a large degree place is described from the tower point of view.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
