Fast Kötter-Nielsen-Høholdt Interpolation over Skew Polynomial Rings and its Application in Coding Theory

by   Hannes Bartz, et al.

Skew polynomials are a class of non-commutative polynomials that have several applications in computer science, coding theory and cryptography. In particular, skew polynomials can be used to construct and decode evaluation codes in several metrics, like e.g. the Hamming, rank, sum-rank and skew metric. We propose a fast divide-and-conquer variant of Kötter-Nielsen-Høholdt (KNH) interpolation algorithm: it inputs a list of linear functionals on skew polynomial vectors, and outputs a reduced Gröbner basis of their kernel intersection. We show, that the proposed KNH interpolation can be used to solve the interpolation step of interpolation-based decoding of interleaved Gabidulin codes in the rank-metric, linearized Reed-Solomon codes in the sum-rank metric and skew Reed-Solomon codes in the skew metric requiring at most Õ(s^ω M(n)) operations in 𝔽_q^m , where n is the length of the code, s the interleaving order, M(n) the complexity for multiplying two skew polynomials of degree at most n, ω the matrix multiplication exponent and Õ(·) the soft-O notation which neglects log factors. This matches the previous best speeds for these tasks, which were obtained by top-down minimal approximant bases techniques, and complements the theory of efficient interpolation over free skew polynomial modules by the bottom-up KNH approach. In contrast to the top-down approach the bottom-up KNH algorithm has no requirements on the interpolation points and thus does not require any pre-processing.


page 1

page 2

page 3

page 4


Fast Kötter-Nielsen-Høholdt Interpolation over Skew Polynomial Rings

Skew polynomials are a class of non-commutative polynomials that have se...

Computing minimal interpolation bases

We consider the problem of computing univariate polynomial matrices over...

Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric

We speed up existing decoding algorithms for three code classes in diffe...

Efficient Decoding of Folded Linearized Reed-Solomon Codes in the Sum-Rank Metric

Recently, codes in the sum-rank metric attracted attention due to severa...

Fast Computation of Minimal Interpolation Bases in Popov Form for Arbitrary Shifts

We compute minimal bases of solutions for a general interpolation proble...

Fast In-place Algorithms for Polynomial Operations: Division, Evaluation, Interpolation

We consider space-saving versions of several important operations on uni...

Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix

Consider a matrix 𝐅∈𝕂[x]^m × n of univariate polynomials over a field 𝕂....

Please sign up or login with your details

Forgot password? Click here to reset