Ruud Pellikaan

Orcid: 0000-0002-9547-3657

According to our database1, Ruud Pellikaan authored at least 40 papers between 1989 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Knot Theory and Error-Correcting Codes.
CoRR, 2023

2022
The extended coset leader weight enumerator of a twisted cubic code.
Des. Codes Cryptogr., 2022

2021
Entanglement-Assisted Quantum Codes From Algebraic Geometry Codes.
IEEE Trans. Inf. Theory, 2021

2019
Application of Complementary Dual AG Codes to Entanglement-Assisted Quantum Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Linear Codes Over 𝔽<sub>q</sub> Are Equivalent to LCD Codes for q>3.
IEEE Trans. Inf. Theory, 2018

Defining the q-Analogue of a Matroid.
Electron. J. Comb., 2018

2017
Cryptanalysis of McEliece Cryptosystem Based on Algebraic Geometry Codes and Their Subcodes.
IEEE Trans. Inf. Theory, 2017

Rank error-correcting pairs.
Des. Codes Cryptogr., 2017

On shortened and punctured cyclic codes.
CoRR, 2017

LCD codes over ${\mathbb F}_q $ are as good as linear codes for q at least four.
CoRR, 2017

On defining generalized rank weights.
Adv. Math. Commun., 2017

2016
A characterization of MDS codes that have an error correcting pair.
Finite Fields Their Appl., 2016

2015
The extended and generalized rank weight enumerator of a code.
ACM Commun. Comput. Algebra, 2015

Error-correcting pairs: a new approach to code-based cryptography.
ACM Commun. Comput. Algebra, 2015

2014
Computational aspects of retrieving a representation of an algebraic geometry code.
J. Symb. Comput., 2014

A Polynomial Time Attack against Algebraic Geometry Code Based Public Key Cryptosystems.
IACR Cryptol. ePrint Arch., 2014

On the unique representation of very strong algebraic geometry codes.
Des. Codes Cryptogr., 2014

Cryptanalysis of Public-Key Cryptosystems That Use Subcodes of Algebraic Geometry Codes.
Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014

2013
The non-gap sequence of a subcode of a generalized Reed-Solomon code.
Des. Codes Cryptogr., 2013

2012
Truncation Formulas for Invariant Polynomials of Matroids and Geometric Lattices.
Math. Comput. Sci., 2012

Error-correcting pairs for a public-key cryptosystem
CoRR, 2012

2010
Special issue algebraic coding theory and applications.
J. Symb. Comput., 2010

2009
Bounded distance decoding of linear error-correcting codes with Gröbner bases.
J. Symb. Comput., 2009

Decoding Linear Error-Correcting Codes up to Half the Minimum Distance with Gröbner Bases.
Proceedings of the Gröbner Bases, Coding, and Cryptography, 2009

2008
Extractors for binary elliptic curves.
Des. Codes Cryptogr., 2008

2007
The Quadratic Extension Extractor for (Hyper)Elliptic Curves in Odd Characteristic.
Proceedings of the Arithmetic of Finite Fields, First International Workshop, 2007

2006
A symmetric Roos bound for linear codes.
J. Comb. Theory A, 2006

2004
List decoding of q-ary Reed-Muller codes.
IEEE Trans. Inf. Theory, 2004

2000
The Newton Polygon of Plane Curves with Many Rational Points.
Des. Codes Cryptogr., 2000

1999
On Weierstrass semigroups and the redundancy of improved geometric Goppa codes.
IEEE Trans. Inf. Theory, 1999

Doing More with Fewer Bits.
Proceedings of the Advances in Cryptology, 1999

1998
Generalized Hamming Weights of q-ary Reed-Muller Codes.
IEEE Trans. Inf. Theory, 1998

1997
Blocking Sets of Almost Rédei Type.
J. Comb. Theory A, 1997

Order Functions and Evaluation Codes.
Proceedings of the Applied Algebra, 1997

1995
The minimum distance of codes in an array coming from telescopic semigroups.
IEEE Trans. Inf. Theory, 1995

On the decoding of algebraic-geometric codes.
IEEE Trans. Inf. Theory, 1995

1992
Decoding geometric Goppa codes using an extra place.
IEEE Trans. Inf. Theory, 1992

On decoding by error location and dependent sets of error positions.
Discret. Math., 1992

1991
Which linear codes are algebraic-geometric?
IEEE Trans. Inf. Theory, 1991

1989
On a decoding algorithm for codes on maximal curves.
IEEE Trans. Inf. Theory, 1989


  Loading...