Fast K\"otter-Nielsen-H{\o}holdt Interpolation in the Guruswami-Sudan Algorithm
Information Theory
2014-06-03 v1 Symbolic Computation
math.IT
Abstract
The K\"otter-Nielsen-H{\o}holdt algorithm is a popular way to construct the bivariate interpolation polynomial in the Guruswami-Sudan decoding algorithm for Reed-Solomon codes. In this paper, we show how one can use Divide & Conquer techniques to provide an asymptotic speed-up of the algorithm, rendering its complexity quasi-linear in n. Several of our observations can also provide a practical speed-up to the classical version of the algorithm.
Keywords
Cite
@article{arxiv.1406.0053,
title = {Fast K\"otter-Nielsen-H{\o}holdt Interpolation in the Guruswami-Sudan Algorithm},
author = {Johan S. R. Nielsen},
journal= {arXiv preprint arXiv:1406.0053},
year = {2014}
}
Comments
Submitted to ACCT-14