36 citations · 98 across the 15 of their papers we have counts for
21 papers
Adjoint and duality for rank-metric codes in a skew polynomial framework
José Gómez-Torrecillas, F. J. Lobillo, Gabriel Navarro +1
Skew polynomial rings provide a fundamental example of noncommutative principal ideal domains. Special quotients of these rings yield matrix algebras that play a central role in th…
Quotients of skew polynomial rings: new constructions of division algebras and MRD codes
F. J. Lobillo, Paolo Santonastaso, John Sheekey
We achieve new results on skew polynomial rings and their quotients, including the first explicit example of a skew polynomial ring where the ratio of the degree of a skew polynomi…
Linear complementary pairs of skew constacyclic codes
F. J. Lobillo, José Manuel Muñoz
Linear complementary pairs (LCPs) of codes have been studied since they were introduced in the context of discussing mitigation measures against possible hardware attacks to integr…
Skew differential Goppa codes and their application to McEliece cryptosystem
José Gómez-Torrecillas, F. J. Lobillo, Gabriel Navarro
A class of linear codes that extends classic Goppa codes to a non-commutative context is defined. An efficient decoding algorithm, based on the solution of a non-commutative key eq…
Roos bound for skew cyclic codes in Hamming and rank metric
Gianira N. Alfarano, F. J. Lobillo, Alessandro Neri
In this paper, a Roos like bound on the minimum distance for skew cyclic codes over a general field is provided. The result holds in the Hamming metric and in the rank metric. The…
Genetic algorithms with permutation-based representation for computing the distance of linear codes
M. P. Cuéllar, J. Gómez-Torrecillas, F. J. Lobillo +1
Finding the minimum distance of linear codes is an NP-hard problem. Traditionally, this computation has been addressed by means of the design of algorithms that find, by a clever e…