The Poincare polynomial of a linear code

In Singularities, Algebraic Geometry, Commutative Algebra, and Related Topics

Festschrift for Antonio Campillo on the Occasion of his 65th Birthday

pp. 525-535, 2018

On varieties and codes defined by quadratic equations

ACA 2016, Applications of Computer Algebra, 22 June 2018, Santiago de Compostela, Spain

CACTC 2018 Computer Algebra in Coding Theory and Cryptography

In Book of abstracts, p. 220-221

Defining the q-analogue of a matroid

The Electronic Journal of Combinatorics Volume 25, Issue 3, P3.2, 2018

The coset leader weight enumerator of the product code of an [m,m-1,2] and an [n,n-1,2] code

Proceedings of the 2018 Symposium on Information Theory and Signal Processing in the Benelux

May 11 - June 1, 2018, Enschede, the Netherlands, L. Spreeuwers & J. Goseling (Eds.), pp. 193-202 , 2018

On shortened and punctured cyclic codes

arxiv 1705.09859v1

Codes, Cryptology and Curves with Computer Algebra

Cambridge University Press, 2017

Is it hard to retrieve an error-correcting pair?

ACA 2016, Applications of Computer Algebra, 1 Aug 2016, Kassel, Germany

CACTC 2016 Computer Algebra in Coding Theory and Cryptography

In Booklet of abstracts, p. 234-236

On the rate of the binary puzzle

International Conference on Graph Theory and Information Security ICGTIS

7-9 August 2017, Universitas Indonesia, Depok, Indonesia

Linear codes over Fq are equivalent to LCD codes for q>3

IEEE Transactions on Information Theory, vol. 64 (4), pp. 3010-3017, 2018

DOI 10.1109/TIT.2018.2789347

Preliminary versions arxiv 1707.08856 and arxiv 1703.04346

Interactive learning in mathematics: Coding Theory and Discrete Algebra

Abstracts International Conference on Research and Education in Mathematics (ICREM)

11-13 August 2017, Institut Teknologi Bandung, pp. 79 , 2017

Binary puzzles as an erasure decoding problem

Proceedings of the 2017 Symposium on Information Theory and Signal Processing in the Benelux

May 11-12, 2017, Delft, the Netherlands, R. Heusdens & J. H. Weber (Eds.), pp. 223-229 , 2017

Error-correcting pairs for a public-key cryptosystem

Journal of Physics: Conference Series 855 012032

Rank error-correcting pairs

Designs, Codes and Cryptography, vol. 84 (1–2), pp. 261–281, 2017

DOI 10.1007/s10623-016-0284-6

Cryptanalysis of McEliece cryptosystems based on algebraic geometry codes and their subcodes

IEEE Transactions on Information Theory, vol. 63 (8), pp. 5404 - 5418, 2017

DOI 10.1109/TIT.2017.2712636

On defining generalized rank weights

Advances in Mathematics of Communications, 632, pp. 229-252, 2015

DOI 10.3934/amc.2017014

A characterization of MDS codes that have an error correcting pair

Finite Fields and Their Applications, vol. 11 (1), pp. 225-235, 2017

DOI 10.1016/j.ffa.2016.04.004

Error-correcting pairs for a public-key cryptosystem

IICMA 2015, Proceedings IICMA 2015 The 3rd IndoMS International Conference on Mathematics and Its Applications

In Advanced Program Book IICMA 2015, p. 16

On the rate of constrained arrays

IICMA 2015, Proceedings IICMA 2015 The 3rd IndoMS International Conference on Mathematics and Its Applications

In Abstract Book, p. 287

A characterization of MDS codes that have an error correcting pair

ACA 2015, Applications of Computer Algebra, 23 July 2015, Kalamata, Greece

CAMMFFAIT@ACA Computational Aspects and Mathematical Methods for Finite Fields

In Booklet of abstracts, p. 287

On defining generalized rank weights

ACA 2015, Applications of Computer Algebra, 23 July 2015, Kalamata, Greece

CAMMFFAIT@ACA Computational Aspects and Mathematical Methods for Finite Fields

In Booklet of abstracts A1-2A-04-011, p. 297

Binary puzzles as an erasure decoding problem

Proceedings of the 36th WIC Symposium on Information Theory in the Benelux

J. Roland and F. Horlin. (Eds.), pp. 129-134 , 2015

The coset leader and list weight enumerator

In Topics in finite fields: 11th International Conference on Finite Fields and their Applications

G.M. Kyureghyan, G.L. Mullen and A. Pott (Eds.)

AMS, Contemporary Mathematics Series, 632, pp. 229-252, 2015

Cryptanalysis of public-key cryptosystems that use subcodes of algebraic geometry codes

4-th International Castle Meeting on Coding Theory and Applications 2014 4ICMCTA 2014, Palmela Castle Portugal

In Coding Theory and Application, CIM Series in Mathematical Sciences 3

R. Pinto, P.R. Malonek and P. Vettori (Eds.), Springer Int. Publishing, pp. 133-140.

The extended and generalized rank weight enumerator of a code

ACA 2014, Applications of Computer Algebra, 9 July 2014, Fordham University, New York

CACTC@ACA Computer Algebra in Coding Theory and Cryptography

In ACM Communications in Computer Algebra, 49(1), 21-21

Error correcting pair: a new approach to code-based cryptography

ACA 2014, Applications of Computer Algebra, 9 July 2014, Fordham University, New York

CACTC@ACA Computer Algebra in Coding Theory and Cryptography

In ACM Communications in Computer Algebra, 49(1), 21-21

A polynomial time attack against algebraic geometry code based public key cryptosystems

ISIT 2014, IEEE International Symposium on Information Theory, 1 July 2014 , Honolulu, Tu-PM2-6: Algebraic Coding Theory 1,

Computational aspects of retrieving a representation of an algebraic geometry code

Journal of Symbolic Computation vol. 64, pp. 67--87, 2014

DOI 10.1016/j.jsc.2013.12.007

On the unique representation of very strong algebraic geometry codes.

Designs, Codes and Cryptography vol. 70, (1-2), pp. 215--230, 2014.

DOI 10.1007/s10623-012-9758-3

Error-correcting pairs and arrays from algebraic geometry codes .

Proceedings of Applications of Computer Algebra ACA 2013, 2 - 6 July 2013, Malaga, pp. 129 -- 132, 2013.

Codes, arrangements and matroids

in Series on Coding Theory and Cryptology vol. 8

Algebraic Geometry Modeling in Information Theory

E. Martínez-Moro Ed., pp. 219--325, World Scientific 2013

The non-gap sequence of a subcode of a generalized Reed-Solomon code

Designs, Codes and Cryptography vol. 66, (1), pp. 317--333, 2013

DOI 10.1007/s10623-012-9694-2

Truncation formulas for invariant polynomials of matroids and geometric lattices

In the special issue on Matroids in Coding Theory and Related Topics

CanaDAM 2011, University of Victoria, 3 June 2011, Canada

Mathematics in Computer Science vol. 6 (2), pp. 121-133, 2012

DOI 10.1007/s11786-012-0118-5

Computational aspects of retrieving a representation of an algebraic geometry code.

SCC 2012, Third international conference on Symbolic Computation and Cryptography,

11-13 July 2012, CIEM - Castro Urdiales, Spain.

Error-correcting pairs for a public-key cryptosystem.

arXiv:1205.3647v1, CBC 2012 Code-based Cryptography Workshop 2012,

9–11 May 2012, Lyngby Denmark.

Evaluation of public-key cryptosystems based on algebraic geometry codes.

Proceedings of the Third International Castle Meeting on Coding Theory and Applications, Cardona Castle in Cardona,

J. Borges and M. Villanueva Eds., September 11-15, Barcelona, pp. 199--204, 2011.

The non-gap sequence of a subcode of a generalized Reed-Solomon code.

Proceedings of the 7-th International Workshop on Coding and Cryptography WCC 2011

N. Sendrier, P. Charpin , M. Finiasz and A. Otmani Eds., April 11-15, Paris, pp. 183--193, 2011.

Editors of special issue of algebraic coding theory and applications,

Journal of Symbolic Computation vol. 45, No. 7, pp. 721--722, July 2010

Decoding and finding the minimum distance with Gröbner bases : history and new insights.

in Series on Coding Theory and Cryptology vol. 7

Selected Topics in Information and Coding Theory,

I. Woungang, S. Misra and S.C. Misra, Eds., vol. 7, pp. 585--622, World Scientific 2010.

The extended coset leader weight enumerator.

Proceedings of the 30th Symposium on Information Theory in the Benelux, WIC 2009,

Tj. Tjalkens and F. Willems Eds., May 28-29, Eindhoven, pp. 217-224, 2009.

Extended and generalized weight enumerators.

Proceedings of the International Workshop on Coding and Cryptography, WCC 2009, Ullensvang

A. Kholosha, E. Rosnes and M. Parker Eds., May 10-15, Selmer Center, Bergen, pp. 76-91, 2009.

Decoding linear error-correcting codes up to half the minimum distance with Gröbner bases.

In Gröbner Bases, Coding, and Cryptography, M. Sala, T. Mora, L. Perret, S. Sakata, and C. Traverso Eds.,

pp. 361-365, Springer, Berlin, 2009.

Bounded distance decoding of linear error-correcting codes with Groebner bases.

Journal of Symbolic Computation vol. 44, pp. 1626-1643, 2009.

Het Modulenboek; een nieuwe structuur voor het service-onderwijs wiskunde aan de TU/e.

Technical University Eindhoven, 37 pp. 2008.

Extractors for binary elliptic curves.

Designs, Codes and Cryptography vol. 49, pp. 171-186, 2008.

DOI 10.1007/s10623-008-9187-5

Decoding error-correcting codes with Groebner bases,.

Proceedings of the 28-th Symposium on Information Theory in the Benelux, WIC 2007,

R. Veldhuis, H. Cronie, H. Hoeksema, Eds., Enschede, May 24-25, pp. 3-10, 2007.

The quadratic extension extractors for (hyper)elliptic curves in odd characteristic.

Lect. Notes in Comp. Sc. vol. 4547, pp. 219-236, 2007.

Extractors for binary elliptic curves.

Proceedings Int. Workshop on Coding and Cryptography 2007, April 16-20, Versailles,

D. Augot, N. Sendrier, J.-P. Tillich Eds., pp. 127-136, 2007.

A symmetric Roos bound for linear codes.

In memory of J.H. van Lint.

Journal of Combinatorial Theory (Series A) vol. 113 (8), pp. 1677-1688, 2006.

Proceedings of the 25-th Symposium on Information Theory in the Benelux,

Kerkrade, The Netherlands, June 2-4,

Werkgemeenschap voor Informatie- en Communicatietheorie,

Eindhoven, 2004, 264 pages.

List decoding of q-ary Reed-Muller codes,

IEEE Trans. Inform. Theory vol. 50, pp. 679-682, April 2004.

DOI 10.1109/TIT.2004.825043

Expanded version.

Integral closures and weight functions over finite fields,

Finite Fields and their Applications vol. 9 (4), pp. 479-504, 2003.

On the structure of order domains,

Finite Fields and their Applications vol. 8, pp. 369-396, 2002.

On the existence of order functions,

Journal of Statistical Planning and Inference vol. 94, pp. 287-301, 2001.

The Newton-polygon of plane curves with many rational points,

Dedicated to J. Seidel in honour of his 80-th birthday, in memoriam,

Designs, Codes and Cryptography vol. 21, pp. 41-67, Oct. 2000.

DOI 10.1023/A:1008323208670

Prepublication: Trinomial curves with many rational points,

IEEE Information Theory Workshop 1998, Killarney, Ireland, June 22 - 26

Doing more with fewer bits,

Lect. Notes Comp. Science , vol. 1716, pp. 321-332,

Advances in Cryptology - Asiacrypt99, Springer-Verlag, Berlin 1999.

On Weierstrass semigroups and the redundancy of improved geometric Goppa codes,

IEEE Trans. Inform. Theory vol. 45, pp. 2512-2519, Nov. 1999.

DOI 10.1109/18.796393

The Golay codes,

in "Some tapas of computer algebra" A.M. Cohen, H. Cuypers, H. Sterk Eds.,

Project 7, pp. 338-347, Springer-Verlag, Berlin 1999.

Gröbner bases for decoding,

in "Some tapas of computer algebra", A.M. Cohen, H. Cuypers, H. Sterk Eds.,

Chap. 11, pp. 260-275, Springer-Verlag, Berlin 1999.

Gröbner bases for codes,

in "Some tapas of computer algebra", A.M. Cohen, H. Cuypers, H. Sterk Eds.,

Chap. 10, pp. 237-259, Springer-Verlag, Berlin 1999.

An elementary approach to algebraic geometry codes,

in Proc. 29 Southeastern Conf. Combinatorics, Graph Theory and Computing,

Boca Raton, 1998, Congressus Numerantium vol. 135, pp. 25-35, 1998.

The Klein quartic, the Fano plane and curves representing designs,

Dedicated to R.E. Blahut in honour of his 60-th birthday,

in Codes, Curves, and Signals: Common Threads in Communications ,

A. Vardy, Ed., pp. 9-20, Kluwer Acad. Publ., Dordrecht 1998.

Algebraic geometry codes,

in Handbook of Coding Theory, vol 1, pp. 871-961,

V.S. Pless, W.C. Huffman and R.A. Brualdi Eds., Elsevier, Amsterdam 1998.

``Reading notes on section 3 ..." by P. Piret, Febr. 17, 2005

Correction

Weierstrass semigroups in an asymptotically good tower of function fields,

Finite Fields and their Applications vol. 4, pp. 381-392, 1998.

Geneneralized Hamming weights of q-ary Reed-Muller codes,

IEEE Trans. Inform. Theory vol. 44, 181-196, 1998.

DOI 10.1109/18.651015

On the missing functions of a pyramid of curves,

in Proc. 35th Allerton Conf. on Communication, Control, and Computing,

Urbana-Champaign, pp. 33-40, September 29 - October 1, 1997.

Order functions and evaluation codes,

Lect. Notes Comp. Sc., vol. 1255, pp. 138-150, Springer, Berlin 1997

Blocking sets of almost Redei type,

Journ. Comb. Theory, Series A, 78, (1997), 141-150

Asymptotically good sequences of curves and codes,

Proc. 34th Allerton Conf. on Communication, Control, and Computing, Urbana-Champaign, October 2-4, 1996, 276-285

On the existence of error-correcting pairs,

Journal of Statistical Planning and Inference 51 (1996) 229-242

On special divisors and the two variable zeta function of algebraic curves over finite fields,

Arithmetic, Geometry and Coding Theory 4, Luminy 1993, Walter de Gruyter & Co, Berlin 1996, 175-184

The shift bound for cyclic, Reed-Muller and geometric Goppa codes,

Arithmetic, Geometry and Coding Theory 4, Luminy 1993, Walter de Gruyter & Co, Berlin 1996, 155-174

The minimum distance of codes in an array coming from telescopic semigroups,

IEEE Transactions Information Theory, vol. 41, (1995), 1720--1732

On the decoding of algebraic-geometric codes,

IEEE Trans. Inform. Theory. IT-41 (1995), 1589--1614

Equality of geometric Goppa codes and equivalence of divisors,

Journ. Pure Appl. Algebra 90 (1993), 229-252

On the efficient decoding of algebraic-geometric codes,

Eurocode 92, Udine, CISM Courses and Lectures 339, Springer, Wien, 1993, pp. 231-253

Self-dual and decomposable geometric Goppa codes,

Eurocode 92, Udine, CISM Courses and Lectures 339, Springer, Wien, 1993, pp. 77-87

On decoding by error location and dependent sets of error positions,

Discrete Math. 106/107 (1992), 369-381

Dedicated to the 60-th birthday of J.H. van Lint

Preprint, Eindhoven University of Technology, 1988

On the gonality of curves, abundant codes and decoding,

in Coding Theory Algebraic Geometry, Luminy 1991, Lect. Notes Math. 1518, Springer, Berlin, 1992, 132-144