Menu

Research Profiles

Articles in Journals

Monographs

Preprints

Articles in Proceedings

Talks

Research Profiles:

Google Scholar
ResearchGate
ResearcherID: O-6782-2017
ORCID: orcid.org/0000-0003-2626-8139
Scopus: Author ID 57190028002
arXiv

  1. Classification of multivariate skew polynomial rings over finite fields via affine transformations of variables

    Finite Fields and Their Applications (In Press), pp. 1-27, 2020. (arXiv)

  2. Systematic Maximum Sum Rank Codes (with P. Almeida and D. Napp)

    Finite Fields and Their Applications (In Press), Vol. 65, pp. 1-24, 2020. (arXiv)

  3. Locally Repairable Convolutional Codes with Sliding Window Repair (with D. Napp)

    IEEE Transactions on Information Theory (In Press), pp. 1-13, 2020. (arXiv)

  4. Universal and Dynamic Locally Repairable Codes with Maximal Recoverability via Sum-Rank Codes (with F. R. Kschischang)

    IEEE Transactions on Information Theory, Vol. 65, N. 12, pp. 7790-7805, 2019. (arXiv)

  5. Reliable and Secure Multishot Network Coding using Linearized Reed-Solomon Codes (with F. R. Kschischang)

    IEEE Transactions on Information Theory, Vol. 65, N. 8, pp. 4785-4803, 2019. (arXiv)

  6. Theory of supports for linear codes endowed with the sum-rank metric

    Designs, Codes and Cryptography, , Vol. 87, N. 10, pp. 2295–2320, 2019. (arXiv)

  7. Evaluation and interpolation over multivariate skew polynomial rings (with F. R. Kschischang)

    Journal of Algebra, Vol. 525, pp. 111-139, 2019. (arXiv)

  8. Bounding the number of common zeros of multivariate polynomials and their consecutive derivatives (with O. Geil)

    Combinatorics, Probability and Computing, Vol. 28, N. 2, pp. 253-279, 2019. (arXiv)

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

    Cryptography and Communications, Vol. 11, N. 2, pp. 147-166, 2019. (arXiv)

  10. Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring

    Journal of Algebra, Vol. 504, pp. 587-612, 2018. (arXiv)

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

    IEEE Transactions on Information Theory, Vol. 64, N. 6, pp. 4191-4206, 2018. (arXiv)

  12. Relative Generalized Matrix Weights of Matrix Codes for Universal Security on Wire-Tap Networks (with R. Matsumoto)

    IEEE Transactions on Information Theory, Vol. 64, N. 4, pp. 2529-2549, 2018. (arXiv)

  13. Generalized Rank Weights of Reducible Codes, Optimal Cases, and Related Properties

    IEEE Transactions on Information Theory, Vol. 64, N. 1, pp. 192-204, 2018. (arXiv)

  14. Rank equivalent and rank degenerate skew cyclic codes

    Advances in Mathematics of Communications, Vol. 11, N. 2, pp. 267-282, 2017. (arXiv)

  15. Rank error-correcting pairs (with R. Pellikaan)

    Designs, Codes and Cryptography, Vol. 84, N. 1-2, pp. 261-281, 2017. (arXiv)

  16. On the roots and minimum rank distance of skew cyclic codes

    Designs, Codes and Cryptography, Vol. 83, N. 3, pp. 639-660, 2017. (arXiv)

  17. Refined analysis of RGHWs of code pairs coming from Garcia-Stichtenoth's second tower (with O. Geil, S. Martin and D. Ruano)

    Journal of Algebra Combinatorics Discrete Structures and Applications. Vol. 4, N. 1, pp. 37-47, 2017. (arXiv)

  18. On asymptotically good ramp secret sharing schemes (with O. Geil, S. Martin, R. Matsumoto and D. Ruano)

    IEICE Trans. Fundamentals. Vol. E100-A, N. 12, pp. 2699-2708, 2017. (arXiv)

  19. On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding

    IEEE Transactions on Information Theory, Vol. 62, N. 7, pp. 4081-4095, 2016. (arXiv)
  20. Back to top

  1. Topics on Reliable and Secure Communication using Rank-Metric and Classical Linear Codes

    Ph.D. Thesis, supervised by O. Geil and D. Ruano, Aalborg University, 2017.

  2. Resoluciones Celulares

    Master's thesis (in Spanish), supervised by P. T. Gimenez, University of Valladolid, 2014.

  3. Una Introducción a la Teoría de las Sicigias

    Bachelor's thesis (in Spanish), supervised by P. T. Gimenez, University of Valladolid, 2013.
  4. Back to top

  1. Theory and applications of linearized multivariate skew polynomials

  2. Hamming and simplex codes for the sum-rank metric

  3. Private Information Retrieval from Locally Repairable Databases with Colluding Servers

  4. Back to top

  1. Zipper Codes: Spatially-Coupled Product-Like Codes with Iterative Algebraic Decoding (with A. Sukmadji and F. R. Kschischang)

    CWIT2019 - Canadian Workshop on Information Theory, 2019.

  2. Private Information Retrieval from Locally Repairable Databases with Colluding Servers

    ISIT2019 - IEEE International Symposium on Information Theory, pp. 1057-1061, 2019.

  3. Locally Repairable Convolutional Codes with Sliding Window Repair (with D. Napp)

    ISIT2019 - IEEE International Symposium on Information Theory, pp. 2838-2842, 2019.

  4. Universal and Dynamic Locally Repairable Codes with Maximal Recoverability via Sum-Rank Codes (with F. R. Kschischang)

    Allerton2018 - 56th Annual Allerton Conference on Communication, Control, and Computing, pp. 792-799, 2018.

  5. Reliable and Secure Multishot Network Coding using Linearized Reed-Solomon Codes (with F. R. Kschischang)

    Allerton2018 - 56th Annual Allerton Conference on Communication, Control, and Computing, pp. 702-709, 2018.

  6. Linearized multivariate skew polynomials and Hilbert 90 Theorems with multivariate norms

    XVI EACA - Encuentros de Álgebra Computacional y Aplicaciones, pp. 119-122, 2018.

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

    ISIT2017 - IEEE International Symposium on Information Theory, pp. 2761-2765, 2017.

  8. Unifying notions of generalized weights for universal security on wire-tap networks (with R. Matsumoto)

    Allerton2016 - 54th Annual Allerton Conference on Communication, Control, and Computing, pp. 800-807, 2016.

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

    ISIT2016 - IEEE International Symposium on Information Theory, pp. 1959-1963, 2016.

  10. Rank equivalent and rank degenerate skew cyclic codes

    WMC2016 - Workshop on Mathematics in Communications, 2016.

  11. Refined analysis of RGHWs of code pairs coming from Garcia-Stichtenoth's second tower (with O. Geil, S. Martin and D. Ruano)

    ACA2015 - Applications of Computer Algebra, 2015.

  12. On asymptotically good ramp secret sharing schemes (with O. Geil, S. Martin, R. Matsumoto and D. Ruano)

    WCC2015 - 9th International Workshop on Coding and Cryptography, 2015.
  13. Back to top

  1. Private Information Retrieval from Locally Repairable Databases with Colluding Servers

    At: ISIT2019 - IEEE International Symposium on Information Theory, Paris, France, June 2019.

  2. Locally Repairable Convolutional Codes with Sliding Window Repair

    At: ISIT2019 - IEEE International Symposium on Information Theory, Paris, France, July 2019.

  3. Hamming and Simplex Codes for the Sum-Rank Metric

    At: Codes, Cryptology and Curves - Celebrating the influence of Ruud Pellikaan, Eindhoven University of Technology, Eindhoven, The Netherlands, March 2019.

  4. Sum-Rank Codes and Linearized Reed-Solomon Codes

    At: ICIAM 2019 - International Congress on Industrial and Applied Mathematics, Valencia, Spain, July 2019, and
    At: Carleton Finite Fields Workshop - Carleton University, Ottawa, Canada, May 2019, and
    At: Seminario GAS - IMUVA - Instituto de Investigación en Matemáticas, Valladolid, Spain, December 2018, and
    At: Clemson RTG - Coding, Cryptography and Number Theory (CCNT) Seminar, Clemson University, Clemson, USA, November 2018.

  5. Universal and Dynamic Locally Repairable Codes with Maximal Recoverability via Sum-Rank Codes

    At: Allerton - 56th Annual Allerton Conference on Communication, Control, and Computing, Monticello, USA, October 2018.

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

    At: Allerton - 56th Annual Allerton Conference on Communication, Control, and Computing, Monticello, USA, October 2018.

  7. Linearized multivariate skew polynomials and Hilbert 90 Theorems with multivariate norms

    At: XVI EACA - Encuentros de Álgebra Computacional y Aplicaciones, Zaragoza, Spain, July 2018.

  8. Skew and linearized Reed-Solomon codes and maximum sum rank distance codes (poster)

    At: MWCC - Munich Workshop on Codes and Cryptography, Munich, Germany, April 2018.

  9. Códigos de la métrica del rango y seguridad en redes (in Spanish)

    At: Seminario GAS - IMUVA - Instituto de Investigación en Matemáticas, Valladolid, Spain, January 2018.

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

    At: DWS - Dune Workshop on Secrets, Skagen, Denmark, October 2017.

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

    At: AG17 - SIAM Conference on Applied Algebraic Geometry, Atlanta, USA, August 2017, and
    At: DWS - Dune Workshop on Secrets, Skagen, Denmark, October 2017.

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

    At: ISIT2017 - IEEE International Symposium on Information Theory, Aachen, Germany, June 2017.

  13. Unifying notions of generalized weights for universal security on wire-tap networks

    At: Allerton - 54th Annual Allerton Conference on Communication, Control, and Computing, Monticello, USA, September 2016, and
    At: Workshop in Coding Theory and Cryptography, Neuchâtel, Switzerland, October 2016.

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

    At: ISIT2016 - IEEE International Symposium on Information Theory, Barcelona, Spain, July 2016.

  15. Rank equivalent and rank degenerate skew cyclic codes

    At: WMC2016 - Workshop on Mathematics in Communications, Santander, Spain, July 2016.

  16. Rank error-correcting pairs

    At: COST Action IC1104 - Network Coding and Designs, Dubrovnik, Croatia, April 2016.

  17. On the roots and minimum rank distance of skew cyclic codes

    At: COST Action IC1104 - Network Coding and Designs, Dubrovnik, Croatia, April 2016.

  18. On Asymptotically Good Ramp Secret Sharing Schemes

    At: WCC2015 - 9th International Workshop on Coding and Cryptography, Paris, France, April 2015, and
    At: 3JCI - RSME 3er Congreso de Jóvenes Investigadores, Murcia, Spain, September 2015.
  19. Back to top