Fast Hermite interpolation and evaluation over finite fields of characteristic two - Archive ouverte HAL Access content directly
Journal Articles Journal of Symbolic Computation Year : 2019

Fast Hermite interpolation and evaluation over finite fields of characteristic two

Abstract

This paper presents new fast algorithms for Hermite interpolation and evaluation over finite fields of characteristic two. The algorithms reduce the Hermite problems to instances of the standard multipoint interpolation and evaluation problems, which are then solved by existing fast algorithms. The reductions are simple to implement and free of multiplications, allowing low overall multiplicative complexities to be obtained. The algorithms are suitable for use in encoding and decoding algorithms for multiplicity codes.
Fichier principal
Vignette du fichier
hermite.pdf (157.58 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01827583 , version 1 (02-07-2018)
hal-01827583 , version 2 (05-09-2019)

Identifiers

Cite

Nicholas Coxon. Fast Hermite interpolation and evaluation over finite fields of characteristic two. Journal of Symbolic Computation, 2019, 98, pp.270-283. ⟨10.1016/j.jsc.2019.07.014⟩. ⟨hal-01827583v2⟩
187 View
776 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More