The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—We present a new multivariate interpolation algorithm over arbitrary fields which is primarily suited for small finite fields. Given function values at arbitrary <tmath>$\big. t\bigr.$</tmath> points, we show that it is possible to find an <it>n</it>-variable interpolating polynomial with at most <tmath>$\big. t\bigr.$</tmath> terms, using the number of field operations that is polynomial in <tmath>$\big. t\bigr.$</tmath> and <tmath>$\big. n\bigr.$</tmath>. The algorithm exploits the structure of the multivariate generalized Vandermonde matrix associated with the problem. Relative to the univariate interpolation, only the minimal degree selection of terms cannot be guaranteed and several term selection heuristics are investigated toward obtaining low-degree polynomials. The algorithms were applied to obtain Reed-Muller and related transforms for incompletely specified functions.</p>
Multivariate interpolation, finite fields, Vandermonde matrices, Reed-Muller transform.
Zeljko Zilic, Zvonko G. Vranesic, "A Deterministic Multivariate Interpolation Algorithm for Small Finite Fields", IEEE Transactions on Computers, vol. 51, no. , pp. 1100-1105, September 2002, doi:10.1109/TC.2002.1032628
97 ms
(Ver 3.3 (11022016))