Francisco Javier Lobillo

Orcid: 0000-0002-7372-0442

Affiliations:
  • University of Granada, Spain


According to our database1, Francisco Javier Lobillo authored at least 34 papers between 1999 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Skew differential Goppa codes and their application to Mceliece cryptosystem.
Des. Codes Cryptogr., December, 2023

Fast parallel computation of reduced row echelon form to find the minimum distance of linear codes.
Expert Syst. Appl., August, 2023

Linear complementary pairs of skew constacyclic codes.
CoRR, 2023

2022
Primitive idempotents in central simple algebras over Fq(t) with an application to coding theory.
Finite Fields Their Appl., 2022

Sum-rank product codes and bounds on the minimum distance.
Finite Fields Their Appl., 2022

2021
Induced Triangular Norms and Negations on Bounded Lattices.
IEEE Trans. Fuzzy Syst., 2021

Genetic algorithms with permutation-based representation for computing the distance of linear codes.
Swarm Evol. Comput., 2021

Cyclic distances of idempotent convolutional codes.
J. Symb. Comput., 2021

Roos bound for skew cyclic codes in Hamming and rank metric.
Finite Fields Their Appl., 2021

Peterson-Gorenstein-Zierler algorithm for differential convolutional codes.
Appl. Algebra Eng. Commun. Comput., 2021

2020
Some remarks on non projective Frobenius algebras and linear codes.
Des. Codes Cryptogr., 2020

Primitive idempotents in central simple algebras over F<sub>q</sub>(t) with an application to coding theory.
CoRR, 2020

2019
Computing the bound of an Ore polynomial. Applications to factorization.
J. Symb. Comput., 2019

2018
Embeddings between lattices of fuzzy sets: An application of closed-valued fuzzy sets.
Fuzzy Sets Syst., 2018

Hartmann-Tzeng bound and skew cyclic codes of designed Hamming distance.
Finite Fields Their Appl., 2018

Dual skew codes from annihilators: Transpose Hamming ring extensions.
CoRR, 2018

Minimum distance computation of linear codes via genetic algorithms with permutation encoding.
ACM Commun. Comput. Algebra, 2018

Computing Free Distances of Idempotent Convolutional Codes.
Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2017
A Sugiyama-Like Decoding Algorithm for Convolutional Codes.
IEEE Trans. Inf. Theory, 2017

Ideal Codes Over Separable Ring Extensions.
IEEE Trans. Inf. Theory, 2017

Computing separability elements for the sentence-ambient algebra of split ideal codes.
J. Symb. Comput., 2017

Lattice embeddings between types of fuzzy sets. Closed-valued fuzzy sets.
CoRR, 2017

Peterson-Gorenstein-Zierler algorithm for skew RS codes.
CoRR, 2017

2016
A New Perspective of Cyclicity in Convolutional Codes.
IEEE Trans. Inf. Theory, 2016

An isomorphism test for modules over a non-commutative PID. Applications to similarity of Ore polynomials.
J. Symb. Comput., 2016

Rough ideals under relations associated to fuzzy ideals.
Inf. Sci., 2016

Convolutional codes with a matrix-algebra word-ambient.
Adv. Math. Commun., 2016

2015
Information-bit error rate and false positives in an MDS code.
Adv. Math. Commun., 2015

Separable Automorphisms on Matrix Algebras over Finite Field Extensions: Applications to Ideal Codes.
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

2014
Generating Idempotents in Ideal Codes.
ACM Commun. Comput. Algebra, 2014

On isomorphisms of modules over non-commutative PID.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

Cyclic Convolutional Codes over Separable Extensions.
Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014

2012
Prime fuzzy ideals over noncommutative rings.
Fuzzy Sets Syst., 2012

1999
When is a finitely generated algebra of Poincaré-Birkhoff-Witt type?
SIGSAM Bull., 1999


  Loading...