Gröbner Bases for Linearized Polynomials

2014/06/18 by Margreta Kuijper, Anna-Lena Trautmann, Kuijper, Margreta +1
Computer Science · Mathematics · #Algebraic Geometry and Number Theory #Coding theory and cryptography #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Polynomial and algebraic computation #Rings and Algebras (math.RA) #Symbolic Computation (cs.SC) #cs.IT #cs.SC #math.IT #math.RA

paper · pdf · doi:10.48550/arxiv.1406.4600

arxiv created 2014/06/18 · openalex publication_date 2014/06/18 · arxiv updated 2014/06/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this work we develop the theory of Gröbner bases for modules over the ring of univariate linearized polynomials with coefficients from a finite field.

Citations

• On a special class of polynomials
• List-Decoding Gabidulin Codes via Interpolation and the Euclidean Algorithm
• Iterative List-Decoding of Gabidulin Codes via Gröbner Based Interpolation

Related

• Gröbner Basis Theory for Modules over Polynomial Rings over Fields with Valuation
• Groebner bases for the polynomial ring with infinite variables and their applications
• Gröbner Bases under Composition, Survey paper
• On the Construction of Gröbner Bases with Coefficients in Quotient Rings
• Existence and Construction of a Gröbner Basis for a Polynomial Ideal