Multiplication of two degree-d < n elements in F_{q^n}[x; σ] costs ilde O(d^{ω_K-1} n) operations over F_q.
Linear codes using skew polynomials with automorphisms and derivations.Designs, Codes and Cryptography, 70(3):405–431, 2014
2 Pith papers cite this work, alongside 94 external citations. Polarity classification is still indexing.
2
Pith papers citing it
94
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
years
2026 2roles
background 1polarities
background 1representative citing papers
GSRS and GLRS codes contain GRS subcodes and are distinguishable from random codes via square-code methods when m+1 < k < n - ½(m² + 3m).
citing papers explorer
-
Complexity of Low-Degree Skew Polynomial Multiplication over Finite Fields
Multiplication of two degree-d < n elements in F_{q^n}[x; σ] costs ilde O(d^{ω_K-1} n) operations over F_q.
-
Distinguishers for Skew and Linearized Reed-Solomon Codes
GSRS and GLRS codes contain GRS subcodes and are distinguishable from random codes via square-code methods when m+1 < k < n - ½(m² + 3m).