Fast Hermite interpolation and evaluation over finite fields of characteristic two

DOI10.1016/j.jsc.2019.07.014zbMath1444.68301arXiv1807.00645OpenAlexW2963539582WikidataQ127477455 ScholiaQ127477455MaRDI QIDQ2284960

Nicholas Coxon

Publication date: 15 January 2020

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.00645

zbMATH Keywords

Hermite interpolationmultiplicity codesHermite evaluation

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (2)

Fast transforms over finite fields of characteristic two ⋮ Simultaneous rational function reconstruction with errors: handling multiplicities and poles

Cites Work

• Functional decomposition of polynomials: the tame case
• A cache-friendly truncated FFT
• On fast multiplication of polynomials over arbitrary algebras
• Fast modular transforms
• Fast multiplication of polynomials over fields of characteristic 2
• Polynomial evaluation and interpolation on special sets of points
• Fast systematic encoding of multiplicity codes
• Fast multiplication of large numbers
• Modern Computer Algebra
• An in-place truncated fourier transform and applications to polynomial multiplication
• Fast Polynomial Multiplication over F _{2 60}
• Faster Polynomial Multiplication over Finite Fields
• Matrix-vector product for confluent Cauchy-like matrices with application to confluent rational interpolation
• A Geometric Approach to Information-Theoretic Private Information Retrieval
• Efficient computation of the DFT with only a subset of input or output points
• Evaluating Polynomials at Fixed Sets of Points
• A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation
• Complexity issues in bivariate polynomial factorization
• The truncated fourier transform and applications
• The Truncated Fourier Transform for Mixed Radices
• Additive Fast Fourier Transforms Over Finite Fields
• A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers
• Binomial Coefficients Modulo a Prime
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast Hermite interpolation and evaluation over finite fields of characteristic two