Publicaciones (58) Publicaciones de FRANCISCO JAVIER LOBILLO BORRERO

2021

  1. Biseparable extensions are not necessarily Frobenius

    Mathematische Zeitschrift, Vol. 297, Núm. 1-2, pp. 517-533

  2. Cyclic distances of idempotent convolutional codes

    Journal of Symbolic Computation, Vol. 102, pp. 37-62

  3. Decoding linear codes over chain rings given by parity check matrices

    Mathematics, Vol. 9, Núm. 16

  4. Genetic algorithms with permutation-based representation for computing the distance of linear codes

    Swarm and Evolutionary Computation, Vol. 60

  5. Induced Triangular Norms and Negations on Bounded Lattices

    IEEE Transactions on Fuzzy Systems, Vol. 29, Núm. 7, pp. 1802-1814

  6. Peterson–Gorenstein–Zierler algorithm for differential convolutional codes

    Applicable Algebra in Engineering, Communications and Computing, Vol. 32, Núm. 3, pp. 321-344

  7. Roos bound for skew cyclic codes in Hamming and rank metric

    Finite Fields and their Applications, Vol. 69

2020

  1. Some remarks on non projective Frobenius algebras and linear codes

    Designs, Codes, and Cryptography, Vol. 88, Núm. 1

2018

  1. Computing free distances of idempotent convolutional codes∗

    Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

  2. Cyclic structures in convolutional codes and free distance

    Applications of Computer Algebra: proceedings

  3. Cálculo aproximado de la distancia mínima de un código lineal

    Monografías de la Real Academia de Ciencias Exactas, Físicas, Químicas y Naturales de Zaragoza, Núm. 43, pp. 99-102

  4. Embeddings between lattices of fuzzy sets: An application of closed-valued fuzzy sets

    Fuzzy Sets and Systems, Vol. 352, pp. 56-72

  5. Hartmann–Tzeng bound and skew cyclic codes of designed Hamming distance

    Finite Fields and their Applications, Vol. 50, pp. 84-112

  6. Minimum distance computation of linear codes via genetic algorithms with permutation encoding

    ACM Communications in Computer Algebra, Vol. 52, Núm. 3, pp. 71-74