José Gómez-Torrecillas

Des. Codes Cryptogr., December, 2023

2022

Primitive idempotents in central simple algebras over Fq(t) with an application to coding theory.

[BibT_eX]

[DOI]

Péter Kutas

Finite Fields Their Appl., 2022

2021

Decoding Reed-Solomon Skew-Differential Codes.

[BibT_eX]

[DOI]

José Patricio Sánchez-Hernández

IEEE Trans. Inf. Theory, 2021

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

[BibT_eX]

[DOI]

Manuel P. Cuéllar

Swarm Evol. Comput., 2021

Cyclic distances of idempotent convolutional codes.

[BibT_eX]

[DOI]

J. Symb. Comput., 2021

Peterson-Gorenstein-Zierler algorithm for differential convolutional codes.

[BibT_eX]

[DOI]

José Patricio Sánchez-Hernández

Appl. Algebra Eng. Commun. Comput., 2021

2020

Some remarks on non projective Frobenius algebras and linear codes.

[BibT_eX]

[DOI]

Erik Hieta-aho

Sergio R. López-Permouth

Des. Codes Cryptogr., 2020

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

[BibT_eX]

[DOI]

Péter Kutas

CoRR, 2020

2019

Computing the bound of an Ore polynomial. Applications to factorization.

[BibT_eX]

[DOI]

J. Symb. Comput., 2019

2018

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

[BibT_eX]

[DOI]

Alessandro Neri

Finite Fields Their Appl., 2018

Dual skew codes from annihilators: Transpose Hamming ring extensions.

[BibT_eX]

[DOI]

CoRR, 2018

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

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2018

Weak Multiplier Bimonoids.

[BibT_eX]

[DOI]

Gabriella Böhm

Stephen Lack

Appl. Categorical Struct., 2018

Computing Free Distances of Idempotent Convolutional Codes.

[BibT_eX]

[DOI]

Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, 2018

2017

A Sugiyama-Like Decoding Algorithm for Convolutional Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Ideal Codes Over Separable Ring Extensions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Computing separability elements for the sentence-ambient algebra of split ideal codes.

[BibT_eX]

[DOI]

J. Symb. Comput., 2017

Peterson-Gorenstein-Zierler algorithm for skew RS codes.

[BibT_eX]

[DOI]

CoRR, 2017

2016

A New Perspective of Cyclicity in Convolutional Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

An isomorphism test for modules over a non-commutative PID. Applications to similarity of Ore polynomials.

[BibT_eX]

[DOI]

J. Symb. Comput., 2016

Convolutional codes with a matrix-algebra word-ambient.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2016

2015

Information-bit error rate and false positives in an MDS code.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2015

Monadic Decompositions and Classical Lie Theory.

[BibT_eX]

[DOI]

Alessandro Ardizzoni

Claudia Menini

Appl. Categorical Struct., 2015

Separable Automorphisms on Matrix Algebras over Finite Field Extensions: Applications to Ideal Codes.

[BibT_eX]

[DOI]

Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

2014

Generating Idempotents in Ideal Codes.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2014

On isomorphisms of modules over non-commutative PID.

[BibT_eX]

[DOI]

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

Cyclic Convolutional Codes over Separable Extensions.

[BibT_eX]

[DOI]

Proceedings of the Coding Theory and Applications, 4th International Castle Meeting, 2014

2012

Basic Module Theory over Non-commutative Rings with Computational Aspects of Operator Algebras.

[BibT_eX]

[DOI]

Proceedings of the Algebraic and Algorithmic Aspects of Differential and Integral Operators, 2012

2006

Comonads and Galois Corings.

[BibT_eX]

[DOI]

Appl. Categorical Struct., 2006

1999

When is a finitely generated algebra of Poincaré-Birkhoff-Witt type?

[BibT_eX]

[DOI]

José L. Bueso