69 citations · 167 across the 27 of their papers we have counts for
5 papers · 1 filter
Block-Krylov techniques in the context of sparse-FGLM algorithms
Seung Gyu Hyun, Vincent Neiger, Hamid Rahkooy +1
Consider a zero-dimensional ideal in . Inspired by Faugère and Mou's Sparse FGLM algorithm, we use Krylov sequences based on multiplication matrices…
Algorithms for zero-dimensional ideals using linear recurrent sequences
Vincent Neiger, Hamid Rahkooy, Éric Schost
Inspired by Faugère and Mou's sparse FGLM algorithm, we show how using linear recurrent multi-dimensional sequences can allow one to perform operations such as the primary decompos…
Two-Point Codes for the Generalized GK curve
Elise Barelli, Peter Beelen, Mrinmoy Datta +2
We improve previously known lower bounds for the minimum distance of certain two-point AG codes constructed using a Generalized Giulietti-Korchmaros curve (GGK). Castellanos and Ti…
Fast Computation of the Roots of Polynomials Over the Ring of Power Series
Vincent Neiger, Johan Rosenkilde, Eric Schost
We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field . More precisely, given a precision , and a polyn…
Computing Canonical Bases of Modules of Univariate Relations
Vincent Neiger, Thi Xuan Vu
We study the computation of canonical bases of sets of univariate relations such that ; here, the input ele…