Related papers: Division algebras and MRD codes from skew polynomi…
We achieve new results on skew polynomial rings and their quotients, including the first explicit example of a skew polynomial ring where the ratio of the degree of a skew polynomial to the degree of its bound is not extremal. These methods…
We extend the existing skew polynomial representations of matrix algebras which are direct sum of matrix spaces over division rings. In this representation, the sum-rank distance between two tuples of matrices is captured by a weight…
In this paper, we first consider the iterated skew polynomial ring $\mathscr{R}[z_1;\tau_1,\delta_{\tau_1}]$\\$[z_2;\tau_2,\delta_{\tau_2}]$, where $\mathscr{R}$ is a finite ring with unity. Then we use this structure for the construction…
We provide an algebraic description for sum-rank metric codes, as quotient space of a skew polynomial ring. This approach generalizes at the same time the skew group algebra setting for rank-metric codes and the polynomial setting for codes…
Reed-Solomon codes and Gabidulin codes have maximum Hamming distance and maximum rank distance, respectively. A general construction using skew polynomials, called skew Reed-Solomon codes, has already been introduced in the literature. In…
In this article we construct a new family of semifields, containing and extending two well-known families, namely Albert's generalised twisted fields and Petit's cyclic semifields (also known as Johnson-Jha semifields). The construction…
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…
Skew polynomial rings were used to construct finite semifields by Petit in 1966, following from a construction of Ore and Jacobson of associative division algebras. In 1989 Jha and Johnson constructed the so-called cyclic semifields,…
We construct a family of (n,k) convolutional codes with degree \delta in {k,n-k} that have a maximum distance profile. The field size required for our construction is of the order n^{2\delta}, which improves upon the known constructions of…
In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise…
We establish a connection between Drinfeld modules and rank-metric codes, focusing on the case of semifield codes. Our method constructs rank-metric codes from linear subspaces of endomorphisms of a Drinfeld module acting on torsion…
Different approaches to construct linear codes using skew polynomials can be unified by using the nonassociative algebras built from skew-polynomial rings by Petit.
We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since…
Some general criteria to produce explicit free algebras inside the division ring of fractions of skew polynomial rings are presented. These criteria are applied to some special cases of division rings with natural involutions, yielding, for…
Let $S$ be a unital ring, $S[t;\sigma,\delta]$ a skew polynomial ring where $\sigma$ is an injective endomorphism and $\delta$ a left $\sigma$-derivation, and suppose $f\in S[t;\sigma,\delta]$ has degree $m$ and an invertible leading…
This preprint is of a chapter to appear in {\it Combinatorics and finite fields: Difference sets, polynomials, pseudorandomness and applications. Radon Series on Computational and Applied Mathematics}, K.-U. Schmidt and A. Winterhof (eds.).…
An associative division algebra D is said to be _affine_ over a central subfield k if D is finitely generated as a k-algebra. In 1956 Amitsur famously proved that, when k is uncountable, D cannot be k-affine unless D is algebraic over k. In…
Employing isomorphisms between their ambient rings, we propose new definitions of equivalence and isometry for skew polycyclic codes that will lead to tighter classifications than existing ones. This reduces the number of previously known…
After recalling the definition of codes as modules over skew polynomial rings, whose multiplication is defined by using an automorphism and a derivation, and some basic facts about them, in the first part of this paper we study some of…
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…