Related papers: Division algebras and MRD codes from skew polynomi…
We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…
We describe an algorithm for fast multiplication of skew polynomials. It is based on fast modular multiplication of such skew polynomials, for which we give an algorithm relying on evaluation and interpolation on normal bases. Our…
Differential difference algebras are generalizations of polynomial algebras, quantum planes, and Ore extensions of automorphism type and of derivation type. In this paper, we investigate the Gelfand-Kirillov dimension of a finitely…
A basic problem for the constant dimension subspace coding is to determine the maximal possible size A_q (n, d, k) of a set of k-dimensional subspaces in Fnq such that the subspace distance satisfies d(U, V )> or =d for any two different…
This dissertation considers new constructions and decoding approaches for error-correcting codes based on non-conventional polynomials, with the objective of providing new coding solutions to the applications mentioned above. With skew…
The square of a skew-symmetric matrix is a symmetric matrix whose eigenvalues have even multiplicities. When the matrices have rank two, they represent the Grassmannian of lines, and the squaring operation takes Pl\"ucker coordinates to…
Given any Koszul algebra of finite global dimension one can define a new algebra, which we call a higher zigzag algebra, as a twisted trivial extension of the Koszul dual of our original algebra. If our original algebra is the path algebra…
Skew axets were first defined by McInroy and Shpectorov where they used the term of axets to classify shapes of an algebra. When they first submitted their paper, it was not known if skew axial algebras exist and now we will present such…
In this paper, we construct four families of linear codes over finite fields from the complements of either the union of subfields or the union of cosets of a subfield, which can produce infinite families of optimal linear codes, including…
New families of eight-dimensional real division algebras with large derivation algebra are presented: We generalize the classical Cayley-Dickson doubling process starting with a unital algebra with involution over a field F by allowing the…
We apply Schrijver's semidefinite programming method to obtain improved upper bounds on generalized distances and list decoding radii of binary codes.
The partition algebra is an associative algebra with a basis of set-partition diagrams and multiplication given by diagram concatenation. It contains as subalgebras a large class of diagram algebras including the Brauer, planar partition,…
We revisit the old idea of constructing difference sets from cyclotomic classes. Two constructions of skew Hadamard difference sets are given in the additive groups of finite fields using unions of cyclotomic classes of order $N=2p_1^m$,…
We give a full classification, up to equivalence, of finite-dimensional graded division algebras over the field of real numbers. The grading group is any abelian group.
MDS self-dual codes have good algebraic structure, and their parameters are completely determined by the code length. In recent years, the construction of MDS Euclidean self-dual codes with new lengths has become an important issue in…
This paper investigates the construction of rank-metric codes with specified Ferrers diagram shapes. These codes play a role in the multilevel construction for subspace codes. A conjecture from 2009 provides an upper bound for the dimension…
The aim of the paper is to extend the class of generalized Weyl algebras to a larger class of rings (they are also called {\em generalized Weyl algebras}) that are determined by two ring endomorphisms rather than one as in the case of `old'…
We find new constructions of infinite families of skew Hadamard difference sets in elementary abelian groups under the assumption of the existence of cyclotomic strongly regular graphs. Our construction is based on choosing cyclotomic…
In an earlier work extensions of supersymmetry and super Lie algebras were constructed consistently starting from any representation $\D$ of any Lie algebra $\g$. Here it is shown how infinite dimensional Lie algebras appear naturally…
Sum-rank-metric codes have wide applications in universal error correction, multishot network coding, space-time coding and the construction of partial-MDS codes for repair in distributed storage. Fundamental properties of sum-rank-metric…