Umberto Martínez-Peñas

Orcid: 0000-0003-2626-8139

According to our database1, Umberto Martínez-Peñas authored at least 35 papers between 2015 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
New constructions of MSRD codes.
CoRR, 2024

Distributed matrix multiplication with straggler tolerance using algebraic function fields.
CoRR, 2024

2023
Doubly and triply extended MSRD codes.
Finite Fields Their Appl., October, 2023

Integer sequences that are generalized weights of a linear code.
CoRR, 2023

Sum-rank metric codes.
CoRR, 2023

2022
A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices.
SIAM J. Discret. Math., September, 2022

Optimal Anticodes, MSRD Codes, and Generalized Weights in the Sum-Rank Metric.
IEEE Trans. Inf. Theory, 2022

Codes in the Sum-Rank Metric: Fundamentals and Applications.
Found. Trends Commun. Inf. Theory, 2022

Zipper Codes.
CoRR, 2022

Multilayer crisscross error and erasure correction.
CoRR, 2022

2021
Sum-Rank BCH Codes and Cyclic-Skew-Cyclic Codes.
IEEE Trans. Inf. Theory, 2021

Maximum Sum-Rank Distance Codes over Finite Chain Rings.
CoRR, 2021

2020
Locally Repairable Convolutional Codes With Sliding Window Repair.
IEEE Trans. Inf. Theory, 2020

Classification of multivariate skew polynomial rings over finite fields via affine transformations of variables.
Finite Fields Their Appl., 2020

Systematic maximum sum rank codes.
Finite Fields Their Appl., 2020

Hamming and simplex codes for the sum-rank metric.
Des. Codes Cryptogr., 2020

2019
Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes.
IEEE Trans. Inf. Theory, 2019

Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes.
IEEE Trans. Inf. Theory, 2019

Theory of supports for linear codes endowed with the sum-rank metric.
Des. Codes Cryptogr., 2019

Bounding the Number of Common Zeros of Multivariate Polynomials and Their Consecutive Derivatives.
Comb. Probab. Comput., 2019

Universal secure rank-metric coding schemes with optimal communication overheads.
Cryptogr. Commun., 2019

Private Information Retrieval from Locally Repairable Databases with Colluding Servers.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Zipper Codes: Spatially-Coupled Product-Like Codes with Iterative Algebraic Decoding.
Proceedings of the 16th Canadian Workshop on Information Theory, 2019

2018
Relative Generalized Matrix Weights of Matrix Codes for Universal Security on Wire-Tap Networks.
IEEE Trans. Inf. Theory, 2018

Communication Efficient and Strongly Secure Secret Sharing Schemes Based on Algebraic Geometry Codes.
IEEE Trans. Inf. Theory, 2018

Generalized Rank Weights of Reducible Codes, Optimal Cases, and Related Properties.
IEEE Trans. Inf. Theory, 2018

2017
On Asymptotically Good Ramp Secret Sharing Schemes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Rank error-correcting pairs.
Des. Codes Cryptogr., 2017

On the roots and minimum rank distance of skew cyclic codes.
Des. Codes Cryptogr., 2017

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

Rank equivalent and rank degenerate skew cyclic codes.
Adv. Math. Commun., 2017

2016
On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding.
IEEE Trans. Inf. Theory, 2016

Unifying notions of generalized weights for universal security on wire-tap networks.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015
On the similarities between rank and Hamming weights and their applications to network coding.
CoRR, 2015

Refined analysis of RGHWs of code pairs coming from Garcia-Stichtenoth's second tower.
CoRR, 2015


  Loading...