Fast operations on linearized polynomials and their applications in coding theory.Journal of Symbolic Computation, 89:194–215, 2018

Sven Puchinger, Antonia Wachter-Zeh · 2018 · Journal of Symbolic Computation · DOI 10.1016/j.jsc.2017.11.012

1 Pith paper cite this work, alongside 2 external citations. Polarity classification is still indexing.

1 Pith paper citing it

2 external citations · OpenAlex

open at publisher browse 1 citing papers

representative citing papers

cs.SC · 2026-07-01 · unverdicted · novelty 7.0

Multiplication of two degree-d < n elements in F_{q^n}[x; σ] costs ilde O(d^{ω_K-1} n) operations over F_q.

Showing 1 of 1 citing paper.

Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields cs.SC · 2026-07-01 · unverdicted · none · ref 12
Multiplication of two degree-d < n elements in F_{q^n}[x; σ] costs ilde O(d^{ω_K-1} n) operations over F_q.