Publications in collaboration with researchers from Aalborg University (19)

2019

  1. 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

  2. Evaluation and interpolation over multivariate skew polynomial rings

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

  3. 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. Generalized rank weights of reducible codes, optimal cases, and related properties

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

  3. 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

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

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

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

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

2017

  1. On asymptotically good ramp secret sharing schemes

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

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

    Designs, Codes, and Cryptography, Vol. 83, Núm. 3, pp. 639-660

  3. Rank equivalent and rank degenerate skew cyclic codes

    Advances in Mathematics of Communications, Vol. 11, Núm. 2, pp. 267-282

  4. Rank error-correcting pairs

    Designs, Codes, and Cryptography, Vol. 84, Núm. 1-2, pp. 261-281

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

    IEEE International Symposium on Information Theory - Proceedings

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

    2017 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT)

2016

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

    IEEE International Symposium on Information Theory - Proceedings

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

    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY

  3. On the Similarities between Generalized Rank and Hamming Weights and Their Applications to Network Coding

    IEEE Transactions on Information Theory, Vol. 62, Núm. 7, pp. 4081-4095

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

    54th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2016

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

    2016 54TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON)