On a decoding algorithm for codes on maximal curves. - Ruud Pellikaan (IEEE Trans. Inf. Theory, 1989)

Which linear codes are algebraic-geometric? - Ruud Pellikaan; Ba-Zhong Shen; Gerhard J. M. van Wee (IEEE Trans. Inf. Theory, 1991)

On decoding by error location and dependent sets of error positions. - Ruud Pellikaan (Discret. Math., 1992)

Decoding geometric Goppa codes using an extra place. - S. C. Porter; Ba-Zhong Shen; Ruud Pellikaan (IEEE Trans. Inf. Theory, 1992)

On the decoding of algebraic-geometric codes. - Tom Høholdt; Ruud Pellikaan (IEEE Trans. Inf. Theory, 1995)

The minimum distance of codes in an array coming from telescopic semigroups. - C. Kirfel; Ruud Pellikaan (IEEE Trans. Inf. Theory, 1995)

Order Functions and Evaluation Codes. - Tom Høholdt; Jacobus H. van Lint; Ruud Pellikaan (AAECC, 1997)

Blocking Sets of Almost Rédei Type. - Aart Blokhuis; Ruud Pellikaan; Tamás Szonyi (J. Comb. Theory A, 1997)

Generalized Hamming Weights of q-ary Reed-Muller Codes. - Petra Heijnen; Ruud Pellikaan (IEEE Trans. Inf. Theory, 1998)

Doing More with Fewer Bits. - Andries E. Brouwer; Ruud Pellikaan; Eric R. Verheul (ASIACRYPT, 1999)

On Weierstrass semigroups and the redundancy of improved geometric Goppa codes. - Ruud Pellikaan; Fernando Torres 002 (IEEE Trans. Inf. Theory, 1999)

The Newton Polygon of Plane Curves with Many Rational Points. - Peter Beelen; Ruud Pellikaan (Des. Codes Cryptogr., 2000)

List decoding of q-ary Reed-Muller codes. - Ruud Pellikaan; Xin-Wen Wu (IEEE Trans. Inf. Theory, 2004)

A symmetric Roos bound for linear codes. - Iwan M. Duursma; Ruud Pellikaan (J. Comb. Theory A, 2006)

The Quadratic Extension Extractor for (Hyper)Elliptic Curves in Odd Characteristic. - Reza Rezaeian Farashahi; Ruud Pellikaan (WAIFI, 2007)

Extractors for binary elliptic curves. - Reza Rezaeian Farashahi; Ruud Pellikaan; Andrey Sidorenko (Des. Codes Cryptogr., 2008)

Decoding Linear Error-Correcting Codes up to Half the Minimum Distance with Gröbner Bases. - Stanislav Bulygin; Ruud Pellikaan (Gröbner Bases, Coding, and Cryptography, 2009)

Bounded distance decoding of linear error-correcting codes with Gröbner bases. - Stanislav Bulygin; Ruud Pellikaan (J. Symb. Comput., 2009)

Special issue algebraic coding theory and applications. - Antonio Campillo; Patrick Fitzpatrick; Edgar Martínez-Moro; Ruud Pellikaan (J. Symb. Comput., 2010)

Error-correcting pairs for a public-key cryptosystem - Irene Marquez Corbella; Ruud Pellikaan (CoRR, 2012)

Truncation Formulas for Invariant Polynomials of Matroids and Geometric Lattices. - Relinde P. M. J. Jurrius; Ruud Pellikaan (Math. Comput. Sci., 2012)

The non-gap sequence of a subcode of a generalized Reed-Solomon code. - Irene Marquez Corbella; Edgar Martínez-Moro; Ruud Pellikaan (Des. Codes Cryptogr., 2013)

Cryptanalysis of Public-Key Cryptosystems That Use Subcodes of Algebraic Geometry Codes. - Alain Couvreur; Irene Márquez-Corbella; Ruud Pellikaan (ICMCTA, 2014)

On the unique representation of very strong algebraic geometry codes. - Irene Marquez Corbella; Edgar Martínez-Moro; Ruud Pellikaan (Des. Codes Cryptogr., 2014)

A Polynomial Time Attack against Algebraic Geometry Code Based Public Key Cryptosystems. - Alain Couvreur; Irene Marquez Corbella; Ruud Pellikaan (IACR Cryptol. ePrint Arch., 2014)

Computational aspects of retrieving a representation of an algebraic geometry code. - Irene Marquez Corbella; Edgar Martínez-Moro; Ruud Pellikaan; Diego Ruano (J. Symb. Comput., 2014)

Error-correcting pairs: a new approach to code-based cryptography. - Irene Marquez Corbella; Ruud Pellikaan (ACM Commun. Comput. Algebra, 2015)

The extended and generalized rank weight enumerator of a code. - Relinde P. M. J. Jurrius; Ruud Pellikaan (ACM Commun. Comput. Algebra, 2015)

A characterization of MDS codes that have an error correcting pair. - Irene Marquez Corbella; Ruud Pellikaan (Finite Fields Their Appl., 2016)

On defining generalized rank weights. - Relinde P. M. J. Jurrius; Ruud Pellikaan (Adv. Math. Commun., 2017)

LCD codes over ${ mathbb F}_q $ are as good as linear codes for q at least four. - Ruud Pellikaan (CoRR, 2017)

On shortened and punctured cyclic codes. - Arti D. Yardi; Ruud Pellikaan (CoRR, 2017)

Rank error-correcting pairs. - Umberto Martínez-Peñas; Ruud Pellikaan (Des. Codes Cryptogr., 2017)

Cryptanalysis of McEliece Cryptosystem Based on Algebraic Geometry Codes and Their Subcodes. - Alain Couvreur; Irene Marquez Corbella; Ruud Pellikaan (IEEE Trans. Inf. Theory, 2017)

Defining the q-Analogue of a Matroid. - Relinde P. M. J. Jurrius; Ruud Pellikaan (Electron. J. Comb., 2018)

Linear Codes Over 𝔽q Are Equivalent to LCD Codes for q>3. - Claude Carlet; Sihem Mesnager; Chunming Tang 001; Yanfeng Qi; Ruud Pellikaan (IEEE Trans. Inf. Theory, 2018)

Application of Complementary Dual AG Codes to Entanglement-Assisted Quantum Codes. - Francisco Revson Fernandes Pereira; Ruud Pellikaan; Giuliano Gadioli La Guardia; Francisco M. de Assis (ISIT, 2019)

Entanglement-Assisted Quantum Codes From Algebraic Geometry Codes. - Francisco Revson Fernandes Pereira; Ruud Pellikaan; Giuliano Gadioli La Guardia; Francisco Marcos de Assis (IEEE Trans. Inf. Theory, 2021)

The extended coset leader weight enumerator of a twisted cubic code. - Aart Blokhuis; Ruud Pellikaan; Tamás Szonyi (Des. Codes Cryptogr., 2022)

Knot theory and error-correcting codes. - Altan Berdan Kilic; Anne Nijsten; Ruud Pellikaan; Alberto Ravagnani (Des. Codes Cryptogr., 2025)