Olav Geil

Orcid: 0000-0002-9666-3399

Affiliations:
  • Aalborg University, Denmark


According to our database1, Olav Geil authored at least 48 papers between 2000 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
From primary to dual affine variety codes over the Klein quartic.
Des. Codes Cryptogr., 2022

2021
Correction to "Fulcrum: Flexible Network Coding for Heterogeneous Devices".
IEEE Access, 2021

2020
On Steane-enlargement of quantum codes from Cartesian product point sets.
Quantum Inf. Process., 2020

On nested code pairs from the Hermitian curve.
Finite Fields Their Appl., 2020

Steane-enlargement of quantum codes from the Hermitian function field.
Des. Codes Cryptogr., 2020

Foreword - Special Issue: Codes, Cryptology and Curves in honour of Ruud Pellikaan.
Des. Codes Cryptogr., 2020

2019
New Binary and Ternary LCD Codes.
IEEE Trans. Inf. Theory, 2019

Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives.
Comb. Probab. Comput., 2019

Steane-Enlargement of Quantum Codes from the Hermitian Curve.
CoRR, 2019

On affine variety codes from the Klein quartic.
Cryptogr. Commun., 2019

Accelerated Processing for Maximum Distance Separable Codes using Composite Extension Fields.
Proceedings of the 25th European Wireless Conference, 2019

2018
Improved Constructions of Nested Code Pairs.
IEEE Trans. Inf. Theory, 2018

Fulcrum: Flexible Network Coding for Heterogeneous Devices.
IEEE Access, 2018

2017
On the distance of stabilizer quantum codes from <i>J</i>-affine variety codes.
Quantum Inf. Process., 2017

List decoding algorithm based on voting in Gröbner bases for general one-point AG codes.
J. Symb. Comput., 2017

On Asymptotically Good Ramp Secret Sharing Schemes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

More results on the number of zeros of multiplicity at least r.
Discret. Math., 2017

Relative generalized Hamming weights of q-ary Reed-Muller codes.
Adv. Math. Commun., 2017

Bounding the Minimum Distance of Affine Variety Codes Using Symbolic Computations of Footprints.
Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017

Random Network Coding over Composite Fields.
Proceedings of the Coding Theory and Applications - 5th International Castle Meeting, 2017

2016
On the distance of stabilizer quantum codes from J-affine variety codes.
CoRR, 2016

2015
Roots and coefficients of multivariate polynomials over finite fields.
Finite Fields Their Appl., 2015

An improvement of the Feng-Rao bound for primary codes.
Des. Codes Cryptogr., 2015

Refined analysis of RGHWs of code pairs coming from Garcia-Stichtenoth's second tower.
CoRR, 2015

2014
Relative Generalized Hamming Weights of One-Point Algebraic Geometric Codes.
IEEE Trans. Inf. Theory, 2014

Further improvements on the Feng-Rao bound for dual codes.
Finite Fields Their Appl., 2014

Erratum to: On the second weight of generalized Reed-Muller codes.
Des. Codes Cryptogr., 2014

Combining subspace codes with classical linear error-correcting codes.
CoRR, 2014

2013
Generalization of the Lee-O'Sullivan list decoding for one-point AG codes.
J. Symb. Comput., 2013

Feng-Rao decoding of primary codes.
Finite Fields Their Appl., 2013

Weighted Reed-Muller codes revisited.
Des. Codes Cryptogr., 2013

2012
List Decoding Algorithm based on Voting in Groebner Bases for General One-Point AG Codes
CoRR, 2012

A New Method for Constructing Small-Bias Spaces from Hermitian Codes.
Proceedings of the Arithmetic of Finite Fields - 4th International Workshop, 2012

List decoding algorithms based on Gröbner bases for general one-point AG codes.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
List decoding of a class of affine variety codes
CoRR, 2011

On the order bounds for one-point AG codes.
Adv. Math. Commun., 2011

2010
On the order bound for one-point AG codes
CoRR, 2010

2009
A Note on the Injection Distance
CoRR, 2009

Tracey Ho and Desmond S. Lun: <i>Network Coding: An Introduction.</i> Cambridge University Press (2008). ISBN 9780521873109, 184 pp.
Comput. J., 2009

Algebraic Geometry Codes from Order Domains.
Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

2008
Evaluation codes from order domain theory.
Finite Fields Their Appl., 2008

On the second weight of generalized Reed-Muller codes.
Des. Codes Cryptogr., 2008

On Field Size and Success Probability in Network Coding.
Proceedings of the Arithmetic of Finite Fields, 2nd International Workshop, 2008

2007
Generalized Sudan's List Decoding for Order Domain Codes.
Proceedings of the Applied Algebra, 2007

2006
On the Feng-Rao Bound for Generalized Hamming Weights.
Proceedings of the Applied Algebra, 2006

2004
The missing evaluation codes from order domain theory.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2001
On Hyperbolic Codes.
Proceedings of the Applied Algebra, 2001

2000
Footprints or generalized Bezout's theorem.
IEEE Trans. Inf. Theory, 2000


  Loading...