Computing minimal interpolation bases.

We consider the problem of computing univariate polynomial matrices over a field that represent minimal solution bases for a general interpolation problem, some forms of which are the vector M-Padé approximation problem in Van Barel and Bultheel (1992) and the rational interpolation problem in Beckermann and Labahn (2000) . Particular instances of this problem include the bivariate interpolation steps of Guruswami–Sudan hard-decision and Kötter–Vardy soft-decision decodings of Reed–Solomon codes, the multivariate interpolation step of list-decoding of folded Reed–Solomon codes, and Hermite–Padé approximation. In the mentioned references, the problem is solved using iterative algorithms based on recurrence relations. Here, we discuss a fast, divide-and-conquer version of this recurrence, taking advantage of fast matrix computations over the scalars and over the polynomials. This new algorithm is deterministic, and for computing shifted minimal bases of relations between m vectors of size σ it uses O ˜ ( m ω − 1 ( σ + | s | ) ) field operations, where ω is the exponent of matrix multiplication, and | s | is the sum of the entries of the input shift s , with min ⁡ ( s ) = 0 . This complexity bound improves in particular on earlier algorithms in the case of bivariate interpolation for soft decoding, while matching fastest existing algorithms for simultaneous Hermite–Padé approximation. [ABSTRACT FROM AUTHOR]