Publicaciones en colaboración con investigadores/as de Universidade Estadual de Campinas (16)

2024

  1. Mathematical properties and numerical approximation of pseudo-parabolic systems

    Computers and Mathematics with Applications, Vol. 165, pp. 163-179

2021

  1. Spectral discretizations analysis with time strong stability preserving properties for pseudo-parabolic models

    Computers and Mathematics with Applications, Vol. 102, pp. 15-44

2020

  1. Locally recoverable codes from algebraic curves with separated variables

    Advances in Mathematics of Communications, Vol. 14, Núm. 2, pp. 265-278

2016

  1. Quantum error-correcting codes from algebraic geometry codes of Castle type

    Quantum Information Processing, Vol. 15, Núm. 10, pp. 4071-4088

2013

  1. Generalized hermitian codes

    Designs, Codes, and Cryptography, Vol. 69, Núm. 1, pp. 123-130

  2. Gröbner basis for norm-trace codes

    Journal of Symbolic Computation, Vol. 48, pp. 54-63

2011

  1. On the order bounds for one-point AG codes

    Advances in Mathematics of Communications, Vol. 5, Núm. 3, pp. 489-504

2009

  1. Castle curves and codes

    Advances in Mathematics of Communications, Vol. 3, Núm. 4, pp. 399-408

  2. Sparse Numerical Semigroups

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2008

  1. A note on the order bound on the minimum distance of ag codes and acute semigroups

    Advances in Mathematics of Communications, Vol. 2, Núm. 2, pp. 175-181

  2. Algebraic geometry codes from castle curves

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

  3. The structure of algebras admitting well-agreeing near weights

    Journal of Pure and Applied Algebra, Vol. 212, Núm. 4, pp. 910-918

  4. Two-point codes on Norm-Trace curves

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2007

  1. Near orders and codes

    IEEE Transactions on Information Theory, Vol. 53, Núm. 5, pp. 1919-1924

2004

  1. Bounding the trellis state complexity of algebraic geometric codes

    Applicable Algebra in Engineering, Communications and Computing, Vol. 15, Núm. 2, pp. 81-100

2003

  1. A goppa-like bound on the trellis state complexity of algebraic-geometric codes

    IEEE Transactions on Information Theory, Vol. 49, Núm. 3, pp. 733-737