From the 1 of 3 linked papers with an AI index.
3 papers
Upper bounds on the length of quasi-MDS codes
Umberto MartÃnez-Peñas, Rubén RodrÃguez-Ballesteros
The paper derives new upper bounds on the length of linear quasi‑MDS (QMDS) codes over finite fields by linking the problem to subspace packing and partial spread constructions fro…
Integer sequences that are generalized weights of a linear code
Elisa Gorla, Elisa Lorenzo GarcÃa, Umberto MartÃnez-Peñas +1
Which integer sequences are sequences of generalized weights of a linear code? In this paper, we answer this question for linear block codes, rank-metric codes, and more generally…
Linear codes in the folded Hamming distance and the quasi MDS property
Umberto MartÃnez-Peñas, Rubén RodrÃguez-Ballesteros
In this work, we study linear codes with the folded Hamming distance, or equivalently, codes with the classical Hamming distance that are linear over a subfield. This includes addi…