49 citations · 193 across the 33 of their papers we have counts for
34 papers
On secret sharing from extended norm-trace curves
Olav Geil
In [4] Camps-Moreno et al. treated (relative) generalized Hamming weights of codes from extended norm-trace curves and they gave examples of resulting good asymmetric quantum error…
Unified Common-Root and Interpolation Bounds Based on Leading Monomial Data
Olav Geil
For general fields the footprint bound from Gröbner basis theory estimates the number of common affine roots of any set of multivariate polynomials using information on their leadi…
Considerate Ramp Secret Sharing
Olav Geil
In this work we revisit the fundamental findings by Chen et al. in [5] on general information transfer in linear ramp secret sharing schemes to conclude that their method not only…
From primary to dual affine variety codes over the Klein quartic
Olav Geil
In [17] a novel method was established to estimate the minimum distance of primary affine variety codes and a thorough treatment of the Klein quartic led to the discovery of a fami…
On multivariate polynomials with many roots over a finite grid
Olav Geil
In this note we consider roots of multivariate polynomials over a finite grid. When given information on the leading monomial with respect to a fixed monomial ordering, the footpri…
On Steane-Enlargement of Quantum Codes from Cartesian Product Point Sets
René Bødker Christensen, Olav Geil
In this work, we study quantum error-correcting codes obtained by using Steane-enlargement. We apply this technique to certain codes defined from Cartesian products previously cons…