Search

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.

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.

Differential Convolutional Codes with designed Hamming distance are defined, and an algebraic decoding algorithm, inspired by Peterson-Gorenstein-Zierler's algorithm, is designed for them., Comment: Revised version: some typos have been fixed and references updated

We give necessary and sufficient conditions on an Ore extension $A[x;\sigma,\delta]$, 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.

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.

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.

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.

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.

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.

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., Comment: 45 pages. The paper is now entirely improved. New references were incorporated and the Picard-Vessiot theory, following Y. Andr\'e, is contemplated as well as Malgrange's and Umemura's approaches to linear differential matrix equations

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.

Based on the novel notion of `weakly counital fusion morphism', regular weak multiplier bimonoids in braided monoidal categories are introduced. They generalize weak multiplier bialgebras over fields and multiplier bimonoids in braided monoidal categories. Under some assumptions the so-called base object of a regular weak multiplier bimonoid is shown to carry a coseparable comonoid structure; hence to possess a monoidal category of bicomodules. In this case, appropriately defined modules over a regular weak multiplier bimonoid are proven to constitute a monoidal category with a strict monoidal forgetful type functor to the category of bicomodules over the base object. Braided monoidal categories considered include various categories of modules or graded modules, the category of complete bornological spaces, and the category of complex Hilbert spaces and continuous linear transformations., Comment: 56 pages

We show that the effective factorization of Ore polynomials over $\mathbb{F}_q(t)$ is still an open problem. This is so because the known algorithm in [1] presents two gaps, and therefore it does not cover all the examples. We amend one of the gaps, and we discuss what kind of partial factorizations can be then computed by using [1].

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.

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.

The present text surveys some relevant situations and results where basic Module Theory interacts with computational aspects of operator algebras. We tried to keep a balance between constructive and algebraic aspects., Comment: To appear in the Proceedings of the AADIOS 2012 conference, to be published in Lecture Notes in Computer Science

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 \'algebras envolventes cuantizadas", by the author, published in "Actas del Encuentro de Matem\'aticos Andaluces Vol. 2, pp. 493-500, ISBN 8447206394, Sevilla, 2001.", Comment: Written in Spanish. The version without proofs was published in the Proceedings of the "Encuentro de Matem\'aticos Andaluces, Sevilla, 17-20 Noviembre, 2000"

We develop a fast algorithm for computing the bound of an Ore polynomial over a skew field, under mild conditions. As an application, we state a criterion for deciding whether a bounded Ore polynomial is irreducible, and we discuss a factorization algorithm. The asymptotic time complexity in the degree of the given Ore polynomial is studied. In the class of Ore polynomials over a finite field, our algorithm is an alternative to Giesbretch's one that reduces the complexity in the degree of the polynomial.

Weak (Hopf) bialgebras are described as (Hopf) bimonoids in appropriate duoidal (also known as 2-monoidal) categories. This interpretation is used to define a category wba of weak bialgebras over a given field. As an application, the "free vector space" functor from the category of small categories with finitely many objects to wba is shown to possess a right adjoint, given by taking (certain) group-like elements. This adjunction is proven to restrict to the full subcategories of groupoids and of weak Hopf algebras, respectively. As a corollary, we obtain equivalences between the category of small categories with finitely many objects and the category of pointed cosemisimple weak bialgebras; and between the category of small groupoids with finitely many objects and the category of pointed cosemisimple weak Hopf algebras., Comment: LaTeX source, v2: 35 pages

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., Comment: LaTeX source, 39 pages

Firm Frobenius algebras are firm algebras and counital coalgebras such that the comultiplication is a bimodule map. They are investigated by categorical methods based on a study of adjunctions and lifted functors. Their categories of comodules and of firm modules are shown to be isomorphic if and only if a canonical comparison functor from the category of comodules to the category of non-unital modules factorizes through the category of firm modules. This happens for example if the underlying algebra possesses local units, e.g. the firm Frobenius algebra arises from a co-Frobenius coalgebra over a base field; or if the comultiplication splits the multiplication (hence the underlying coalgebra is coseparable).

In this paper, a refinement of the weight distribution in an MDS code is computed. Concretely, the number of codewords with a fixed amount of nonzero bits in both information and redundancy parts is obtained. This refinement improves the theoretical approximation of the information-bit and -symbol error rate, in terms of the channel bit-error rate, in a block transmission through a discrete memoryless channel. Since a bounded distance reproducing encoder is assumed, the computation of the here-called false positive (a decoding failure with no information-symbol error) is provided. As a consequence, a new performance analysis of an MDS code is proposed.

Given a weak distributive law between algebras underlying two weak bialgebras, we present sufficient conditions under which the corresponding weak wreath product algebra becomes a weak bialgebra with respect to the tensor product coalgebra structure. When the weak bialgebras are weak Hopf algebras, then the same conditions are shown to imply that the weak wreath product becomes a weak Hopf algebra, too. Our sufficient conditions are capable to describe most known examples, (in particular the Drinfel'd double of a weak Hopf algebra)., Comment: 18 pages, several diagrams

We show that the functor from bialgebras to vector spaces sending a bialgebra to its subspace of primitives has monadic length at most 2., Comment: The new version of the file simplifies the exposition of the original one while the former is more detailed

We study the (so-called bilinear) factorization problem answered by a weak wreath product (of monads and, more specifically, of algebras over a commutative ring) in the works by Street and by Caenepeel and De Groot. A bilinear factorization of a monad R turns out to be given by monad morphisms A --> R <-- B inducing a split epimorphism of B-A bimodules B @ A --> R. We prove a biequivalence between the bicategory of weak distributive laws and an appropriately defined bicategory of bilinear factorization structures. As an illustration of the theory, we collect some examples of algebras over commutative rings which admit a bilinear factorization; i.e. which arise as weak wreath products., Comment: 17 pages, LaTeX source

We develop a Galois (descent) theory for comonads within the framework of bicategories. We give generalizations of Beck's theorem and the Joyal-Tierney theorem. Many examples are provided, including classical descent theory, Hopf-Galois theory over Hopf algebras and Hopf algebroids, Galois theory for corings and group-corings, and Morita-Takeuchi theory for corings. As an application we construct a new type of comatrix corings based on (dual) quasi bialgebras., Comment: 39 pages

We study serial coalgebras by means of their valued Gabriel quivers. In particular, Hom-computable and representation-directed coalgebras are characterized. The Auslander-Reiten quiver of a serial coalgebra is described. Finally, a version of Eisenbud-Griffith theorem is proved, namely, every subcoalgebra of a prime, hereditary and strictly quasi-finite coalgebra is serial., Comment: 22 pages

To any bimodule which is finitely generated and projective on one side one can associate a coring, known as a comatrix coring. A new description of comatrix corings in terms of data reminiscent of a Morita context is given. It is also studied how properties of bimodules are reflected in the associated comatrix corings. In particular it is shown that separable bimodules give rise to coseparable comatrix corings, while Frobenius bimodules induce Frobenius comatrix corings., Comment: 13 pages, LaTeX