Publicaciones en colaboración con investigadores/as de Aalborg University (49)

2023

  1. AN ALGORITHMIC APPROACH TO ENTANGLEMENT-ASSISTED QUANTUM ERROR-CORRECTING CODES FROM THE HERMITIAN CURVE

    Advances in Mathematics of Communications, Vol. 17, Núm. 1, pp. 78-97

2021

  1. Erratum: Fulcrum: Flexible Network Coding for Heterogeneous Devices (IEEE Access (2018) 6 (77890-77910) DOI: 10.1109/ACCESS.2018.2884408)

    IEEE Access

2020

  1. Foreword—Special Issue: Codes, Cryptology and Curves in honour of Ruud Pellikaan

    Designs, Codes, and Cryptography

  2. Squares of matrix-product codes

    Finite Fields and their Applications, Vol. 62

2019

  1. Accelerated processing for maximum distance separable codes using composite extension fields

    European Wireless 2019 Conference, EW 2019

  2. Bounding the number of common zeros of multivariate polynomials and their consecutive derivatives

    Combinatorics Probability and Computing, Vol. 28, Núm. 2, pp. 253-279

  3. Classical and Quantum Evaluation Codes at the Trace Roots

    IEEE Transactions on Information Theory, Vol. 65, Núm. 4, pp. 2593-2602

  4. Constructing sequences with high nonlinear complexity using the Weierstrass semigroup of a pair of distinct points of a Hermitian curve

    Semigroup Forum, Vol. 98, Núm. 3, pp. 543-555

  5. Entanglement-assisted quantum error-correcting codes over arbitrary finite fields

    Quantum Information Processing, Vol. 18, Núm. 4

  6. Evaluation and interpolation over multivariate skew polynomial rings

    Journal of Algebra, Vol. 525, pp. 111-139

  7. Improved bounds on the threshold gap in ramp secret sharing

    IEEE Transactions on Information Theory, Vol. 65, Núm. 7, pp. 4620-4633

  8. New Binary and Ternary LCD Codes

    IEEE Transactions on Information Theory, Vol. 65, Núm. 2, pp. 1008-1016

  9. Universal secure rank-metric coding schemes with optimal communication overheads

    Cryptography and Communications, Vol. 11, Núm. 2, pp. 147-166

2018

  1. Communication Efficient and Strongly Secure Secret Sharing Schemes Based on Algebraic Geometry Codes

    IEEE Transactions on Information Theory, Vol. 64, Núm. 6, pp. 4191-4206

  2. Fulcrum: Flexible network coding for heterogeneous devices

    IEEE Access, Vol. 6, pp. 77890-77910

  3. Generalized rank weights of reducible codes, optimal cases, and related properties

    IEEE Transactions on Information Theory, Vol. 64, Núm. 1, pp. 192-204

  4. Improved Constructions of Nested Code Pairs

    IEEE Transactions on Information Theory, Vol. 64, Núm. 4, pp. 2444-2459

  5. Relative Generalized Matrix Weights of Matrix Codes for Universal Security on Wire-Tap Networks

    IEEE Transactions on Information Theory, Vol. 64, Núm. 4, pp. 2529-2549

  6. Reliable and Secure Multishot Network Coding using Linearized Reed-Solomon Codes

    2018 56TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON)

  7. Skew and linearized Reed–Solomon codes and maximum sum rank distance codes over any division ring

    Journal of Algebra, Vol. 504, pp. 587-612