Searcharxiv⌕ Search

arXiv subjects

José Gómez-Torrecillas

Publications and source records attributed to José Gómez-Torrecillas.

At least 19 recordsLinked to original sources
arXiv2026

Skew Laurent Series and General Cyclic Convolutional Codes

Convolutional codes were originally conceived as vector subspaces of a finite-dimensional vector space over a field of Laurent series having a polynomial basis. Piret and Roos modeled cyclic structures on them by adding a module structure over a finite-dimensional algebra skewed by an algebra automorphism. These cyclic convolutional codes turn out to be equivalent to some right ideals of a skew polynomial ring built from the automorphism. When a skew derivation is considered, serious difficulties arise in defining such a skewed module structure on Laurent series. We discuss some solutions to this problem which involve a purely algebraic treatment of the left skew Laurent series built from a left skew derivation of a general coefficient ring, when possible.

math.RA↗
arXiv2025

Adjoint and duality for rank-metric codes in a skew polynomial framework

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 the theory of rank-metric codes. Recent breakthroughs have shown that specific subsets of these quotients produce the largest known families of maximum rank distance (MRD) codes. In this work, we present a systematic study of transposition and duality operations within quotients of skew polynomial rings. We develop explicit skew-polynomial descriptions of the transpose and dual code constructions, enabling us to determine the adjoint and dual codes associated with the MRD code families recently introduced by Sheekey et al. Building on these results, we compute the nuclear parameters of these codes, and prove that, for a new infinite set of parameters, many of these MRD codes are inequivalent to previously known constructions in the literature.

cs.IT↗
arXiv2022

Skew differential Goppa codes and their application to McEliece cryptosystem

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 equation, is designed. We show how the parameters of these codes, when the alphabet is a finite field, may be adjusted to propose a McEliece-type cryptosystem.

cs.IT↗
arXiv2020

Decoding Reed-Solomon Skew-Differential Codes

A large class of MDS linear codes is constructed. These codes are endowed with an efficient decoding algorithm. Both the definition of the codes and the design of their decoding algorithm only require from Linear Algebra methods, making them fully accesible for everyone. Thus, the first part of the paper develops a direct presentation of the codes by means of parity-check matrices, and the decoding algorithm rests upon matrix and linear maps manipulations. The somewhat more sophisticated mathematical context (non-commutative rings) needed for the proof of the correctness of the decoding algorithm is postponed to the second part. A final section locates the Reed-Solomon skew-differential codes introduced here within the general context of codes defined by means of skew polynomial rings.

cs.IT↗
arXiv2020

Biseparable extensions are not necessarily Frobenius

We give necessary and sufficient conditions on an Ore extension $A[x;σ,δ]$, where $A$ is a finite dimensional algebra over a field $\mathbb{F}$, for being a Frobenius extension over the ring of commutative polynomials $\mathbb{F}[x]$. As a consequence, as the title of this paper highlights, we provide a negative answer to a problem stated by Caenepeel and Kadison.

math.RA↗
arXiv2019

Some remarks on non projective Frobenius algebras and linear codes

With a small suitable modification, dropping the projectivity condition, we extend the notion of a Frobenius algebra to grant that a Frobenius algebra over a Frobenius commutative ring is itself a Frobenius ring. The modification introduced here also allows Frobenius finite rings to be precisely those rings which are Frobenius finite algebras over their characteristic subrings. From the perspective of linear codes, our work expands one's options to construct new finite Frobenius rings from old ones. We close with a discussion of generalized versions of the MacWilliams identities that may be obtained in this context.

math.RA↗
arXiv2018

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

We design a heuristic method, a genetic algorithm, for the computation of an upper bound of the minimum distance of a linear code over a finite field. By the use of the row reduced echelon form, we obtain a permutation encoding of the problem, so that its space of solutions does not depend on the size of the base field or the dimension of the code. Actually, the efficiency of our method only grows non-polynomially with respect to the length of the code.

cs.IT↗
arXiv2018

Finite dual of a cocommutative Hopf algebroid. Application to linear differential matrix equations and Picard-Vessiot theory

A fundamental tool of Differential Galois Theory is the assignment of an algebraic group to each finite-dimensional differential module over differential field in such a way that the category of differential modules it generates is equivalent, as a symmetric monoidal category, to the category of representations of the group. Its underlying set is then recognized as the group of differential automorphisms of the Picard-Vessiot field extension of the base field for this differential module. These results can be obtained by means of a Tannaka reconstruction process, applied to the abelian category of finite-dimensional differential modules. In this paper, we explore the possibility of extending this theory when the differential field is replaced by a more general differential ring $A$. In this case, it is reasonable to deal with differential modules which are finitely generated and projective over $A$. A major obstacle is that this category is not abelian, in contrast with the classical case when $A$ is a field. To overcome this difficulty, we develop some fundamental results concerning the \emph{finite dual}, hereby introduced, of a cocommutative Hopf algebroid, and a canonical monoidal functor sending (differential) modules to comodules. This functor is proved to be an equivalence of categories whenever a canonical ring homomorphism, which is introduced in this work, with domain in the aforementioned finite dual and with values in the convolutional ring, is injective. Module-theoretical sufficient conditions to get its injectivity are investigated. This machinery is applied to differential modules and their Picard-Vessiot theory.

math.RA↗
arXiv2018

Dual skew codes from annihilators: Transpose Hamming ring extensions

In this paper a framework to study the dual of skew cyclic codes is proposed. The transposed Hamming ring extensions are based in the existence of an anti-isomorphism of algebras between skew polynomial rings. Our construction is applied to left ideal convolutional codes, skew constacyclic codes and skew Reed-Solomon code, showing that the dual of these codes belong to the same class.

cs.IT↗
arXiv2017

Hartmann--Tzeng bound and Skew Cyclic Codes of Designed Hamming Distance

The use of skew polynomial rings allows to endow linear codes with cyclic structures which are not cyclic in the classical (commutative) sense. Whenever these skew cyclic structures are carefully chosen, some control over the Hamming distance is gained, and it is possible to design efficient decoding algorithms. In this paper, we give a version of the Hartmann-Tzeng bound that works for a wide class of skew cyclic codes. We also provide a practical method for constructing them with designed distance. For skew BCH codes, which are covered by our constructions, we discuss decoding algorithms. Detailed examples illustrate both the theory as the constructive methods it supports.

cs.IT↗
arXiv2017

Peterson-Gorenstein-Zierler algorithm for skew RS codes

We design a non-commutative version of the Peterson-Gorenstein-Zierler decoding algorithm for a class of codes that we call skew RS codes. These codes are left ideals of a quotient of a skew polynomial ring, which endow them of a sort of non-commutative cyclic structure. Since we work over an arbitrary field, our techniques may be applied both to linear block codes and convolutional codes. In particular, our decoding algorithm applies for block codes beyond the classical cyclic case.

cs.IT↗
arXiv2016

A Sugiyama-like decoding algorithm for convolutional codes

We propose a decoding algorithm for a class of convolutional codes called skew BCH convolutional codes. These are convolutional codes of designed Hamming distance endowed with a cyclic structure yielding a left ideal of a non-commutative ring (a quotient of a skew polynomial ring). In this setting, right and left division algorithms exist, so our algorithm follows the guidelines of the Sugiyama's procedure for finding the error locator and error evaluator polynomials for BCH block codes.

cs.IT↗
arXiv2015

Hereditary triangular matrix comonads

We recognise Harada's generalized categories of diagrams as a particular case of modules over a monad defined on a finite direct product of additive categories. We work in the dual (albeit formally equivalent) situation, that is, with comodules over comonads. With this conceptual tool at hand, we obtain several of the Harada results with simpler proofs, some of them under more general hypothesis, besides with a characterization of the normal triangular matrix comonads that are hereditary, that is, of homological dimension less or equal than $1$. Our methods rest on a matrix representation of additive functors and natural transformations, which allows us to adapt typical algebraic manipulations from Linear Algebra to the additive categorical setting.

math.RA↗
arXiv2014

Ideal codes over separable ring extensions

This paper investigates the application of the theoretical algebraic notion of a separable ring extension, in the realm of cyclic convolutional codes or, more generally, ideal codes. We work under very mild conditions, that cover all previously known as well as new non trivial examples. It is proved that ideal codes are direct summands as left ideals of the underlying non-commutative algebra, in analogy with cyclic block codes. This implies, in particular, that they are generated by an idempotent element. Hence, by using a suitable separability element, we design an efficient algorithm for computing one of such idempotents.

cs.IT↗
arXiv2013

Re-filtración y propiedades de regularidad de anillos multi-filtrados

Quantum bounded extensions of multifiltered algebras are defined, and they are endowed with a new multifiltration. The behavior of the associated multigraded rings is studied. A refiltering process allows to lift homological properties from the associated multigraded ring to the multifiltered ring. This is the full version, with proofs, of the paper entitled "Regularidad de las álgebras envolventes cuantizadas", by the author, published in "Actas del Encuentro de Matemáticos Andaluces Vol. 2, pp. 493-500, ISBN 8447206394, Sevilla, 2001."

math.QA↗
arXiv2013

Weak multiplier bialgebras

A non-unital generalization of weak bialgebra is proposed with a multiplier-valued comultiplication. Certain canonical subalgebras of the multiplier algebra (named the `base algebras') are shown to carry coseparable co-Frobenius coalgebra structures. Appropriate modules over a weak multiplier bialgebra are shown to constitute a monoidal category via the (co)module tensor product over the base algebra. The relation to Van Daele and Wang's (regular and arbitrary) weak multiplier Hopf algebra is discussed.

math.QA↗