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 there are much more skew-cyclic codes, this new class of codes allows to systematically search for codes with good properties. We give many examples of codes which improve the previously best known linear codes.
We study cyclic codes with arbitrary length over Fp+vFp where theta(v)=av, a in Fp and v^2=0. We characterize all existing codes in case of O(theta)|n by using certain projections from (Fp+vFp)[x;theta] to Fp[x]. We provide an explicit expression for the ensemble of all possible codes. We also prove useful properties of these codes in the case where O(theta)|n does not hold. We provide results and examples to illustrate how the codes are constructed and how their encoding and decoding are realized.
This is a survey on the theory of skew-cyclic codes based on skew-polynomial rings of automorphism type. Skew-polynomial rings have been introduced and discussed by Ore (1933). Evaluation of skew polynomials and sets of (right) roots were first considered by Lam (1986) and studied in great detail by Lam and Leroy thereafter. After a detailed presentation of the most relevant properties of skew polynomials, we survey the algebraic theory of skew-cyclic codes as introduced by Boucher and Ulmer (2007) and studied by many authors thereafter. A crucial role will be played by skew-circulant matrices…
In the present paper, we study skew cyclic codes over the ring $F_{q}+vF_{q}+v^2F_{q}$, where $v^3=v,~q=p^m$ and $p$ is an odd prime. We investigate the structural properties of skew cyclic codes over $F_{q}+vF_{q}+v^2F_{q}$ using decomposition method. By defining a Gray map from $F_{q}+vF_{q}+v^2F_{q}$ to $F_{q}^3$, it has been proved that the Gray image of a skew cyclic code of length $n$ over $F_{q}+vF_{q}+v^2F_{q}$ is a skew $3$-quasi cyclic code of length $3n$ over $F_{q}$. Further, it is shown that the skew cyclic codes over $F_{q}+vF_{q}+v^2F_{q}$ are principally generated. Finally, the…
We define a nonassociative generalization of cyclic Azumaya algebras employing skew polynomial rings $D[t;σ]$, where $D$ is an Azumaya algebra of constant rank with center $C$ and $σ$ an automorphism of $D$, such that $σ|_{C}$ has finite order. The automorphisms of these algebras are canonically induced by ring automorphisms of the skew polynomial ring $D[t;σ]$ used in their construction. We achieve a description of their inner automorphisms. Results on the automorphisms of classical Azumaya algebras and central simple algebras of this type are obtained as special cases.
Let $G$ and $N$ be two finite groups of the same order. It is well-known that the existences of the following are equivalent: (a) a Hopf-Galois structure of type $N$ on any Galois $G$-extension; (b) a skew brace with additive group $N$ and multiplicative group $G$; (c) a regular subgroup isomorphic to $G$ in the holomorph of $N$. We shall say that $(G,N)$ is realizable when any of the above exists. Fixing $N$ to be a cyclic group, W. Rump (2019) has determined the groups $G$ for which $(G,N)$ is realizable. In this paper, fixing $G$ to be a cyclic group instead, we shall give a complete charac…
We propose a variation of Construction A of lattices from linear codes defined using the quotient $Λ/\mathfrak pΛ$ of some order $Λ$ inside a cyclic division $F$-algebra, for $\mathfrak p$ a prime ideal of a number field $F$. To obtain codes over this quotient, we first give an isomorphism between $Λ/\mathfrak pΛ$ and a ring of skew polynomials. We then discuss definitions and basic properties of skew polynomial codes, which are needed for Construction A, but also explore further properties of the dual of such codes. We conclude by providing an application to space-time coding, which is the or…
In this paper we study a special type of quasi-cyclic (QC) codes called skew QC codes. This set of codes is constructed using a non-commutative ring called the skew polynomial rings $F[x;θ]$. After a brief description of the skew polynomial ring $F[x;θ]$ it is shown that skew QC codes are left submodules of the ring $R_{s}^{l}=(F[x;θ]/(x^{s}-1))^{l}.$ The notions of generator and parity-check polynomials are given. We also introduce the notion of similar polynomials in the ring $F[x;θ]$ and show that parity-check polynomials for skew QC codes are unique up to similarity. Our search results lea…
We describe families of nonassociative finite unital rings that occur as quotients of natural nonassociative orders in generalized nonassociative cyclic division algebras over number fields. These natural orders have already been used to systematically construct fully diverse fast-decodable space-time block codes. We show how the quotients of natural orders can be employed for coset coding. Previous results by Oggier and Sethuraman involving quotients of orders in associative cyclic division algebras are obtained as special cases.
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, obtained using irreducible semilinear transformations. In this work we show that these two constructions in fact lead to isotopic semifields, show how the skew polynomial construction can be used to calculate the nuclei more easily, and provide an upper bound for the number of isotopism classes, improving the bounds obtained by Kantor and Liebler in 2008 and impli…
Let $D$ be a division algebra, finite-dimensional over its center, and $R=D[t;σ,δ]$ a skew polynomial ring. Using skew polynomials $f\in R$, we construct division algebras and a generalization of maximum rank distance codes consisting of matrices with entries in a noncommutative division algebra or field. These include a class of codes constructed by Sheekey (in particular, generalized Gabidulin codes), as well as Jha Johnson semifields.
In this paper convolutional codes with cyclic structure will be investigated. These codes can be understood as left principal ideals in a suitable skew-polynomial ring. It has been shown in [3] that only certain combinations of the parameters (field size, length, dimension, and Forney indices) can occur for cyclic codes. We will investigate whether all these combinations can indeed be realized by a suitable cyclic code and, if so, how to construct such a code. A complete characterization and construction will be given for minimal cyclic codes. It is derived from a detailed investigation of the…
In this paper, we give some characterizations of the ring $R[x,y,ρ,θ]$ where R is a commutative ring. We investigate 2-D skew $(λ_1,λ_2)$-constacyclic codes.
In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe the algebraic parameters of the codes in a more accessible way. We show that the existence of such codes with given algebraic parameters can be reduced to the solvability of a modified rook problem. It is our strong belief that the rook problem is always solvable, and we present solutions in particular cases.
Let $K$ be a field and $σ$ an automorphism of $K$ of order $n$.Employing a nonassociative algebra, we study the eigenspace of a bounded skew polynomial $f\in K[t;σ]$. We mainly treat the case that $K/F$ is a cyclic field extension of degree $n$ with Galois group generated by $σ$. We obtain lower bounds on the dimension of the eigenspace, and compute it in special cases as a quotient algebra. Conditions under which a monic polynomial $f\in F[t]\subset K[t;σ]$ is reducible are obtained in special cases.
$\DeclareMathOperator{\Aut}{Aut}$Let $p, q$ be distinct primes, with $p > 2$. We classify the Hopf-Galois structures on Galois extensions of degree $p^{2} q$, such that the Sylow $p$-subgroups of the Galois group are cyclic. This we do, according to Greither and Pareigis, and Byott, by classifying the regular subgroups of the holomorphs of the groups $(G, \cdot)$ of order $p^{2} q$, in the case when the Sylow $p$-subgroups of $G$ are cyclic. This is equivalent to classifying the skew braces $(G, \cdot, \circ)$. Furthermore, we prove that if $G$ and $Γ$ are groups of order $p^{2} q$ with non-is…
Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right divisors of $x^n-λ$, where $λ$ is a unit element, are exhibited. When $λ^2=1$, the generators of Euclidean and Hermitian dual codes of such codes are determined together with necessary and sufficient conditions for them to be Euclidean and Hermitian self-dual. Of more interest are codes over the ring $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$. The structure of all …
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.
Different approaches to construct linear codes using skew polynomials can be unified by using the nonassociative algebras built from skew-polynomial rings by Petit.
In this article, we study skew constacyclic codes over a class of finite commutative semisimple rings. The automorphism group of $\mathcal{R}=\prod_{i=1}^t F_q$ is determined, and we characterize skew constacyclic codes over ring by linear codes over finite field. We also define homomorphisms which map linear codes over $\mathcal{R}$ to matrix product codes over $F_q,$ some optimal linear codes over finite fields are obtained.
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 also gives examples of semifields with parameters for which no examples were previously known. In the case of semifields two dimensions over a nucleus and four-dimensional over their centre, the construction gives all possible examples. Furthermore we embed these semifields in a new family of maximum rank-distance codes, encompassing most known current construc…
In this paper, the investigation on the algebraic structure of the ring $\frac{\mathbb{F}_q[v]}{\langle\,v^q-v\,\rangle}$ and the description of its automorphism group, enable to study the algebraic structure of codes and their dual over this ring. We explore the algebraic structure of skew-constacyclic codes, by using a linear Gray map and we determine their generator polynomials. Necessary and sufficient conditions for the existence of self-dual skew cyclic and self-dual skew negacyclic codes over $\frac{\mathbb{F}_q[v]}{\langle\,v^q-v\,\rangle}$ are given.
In this paper we investigate left ideals as codes in twisted skew group rings. The considered rings, which are often algebras over a finite field, allows us to detect many of the well-known codes. The presentation, given here, unifies the concept of group codes, twisted group codes and skew group codes.
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 their main algebraic and geometric properties. Finally, for module skew codes constructed only with an automorphism, we give some BCH type lower bounds for their minimum distance.
We introduce circulant matrices that capture the structure of a skew-polynomial ring F[x;θ] modulo the left ideal generated by a polynomial of the type x^n-a. This allows us to develop an approach to skew-constacyclic codes based on such circulants. Properties of these circulants are derived, and in particular it is shown that the transpose of a certain circulant is a circulant again. This recovers the well-known result that the dual of a skew-constacyclic code is a constacyclic code again. Special attention is paid to the case where x^n-a is two-sided.
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 algori…
We construct a family of (n,k) convolutional codes with degree δin {k,n-k} that have a maximum distance profile. The field size required for our construction is of the order n^{2δ}, which improves upon the known constructions of convolutional codes with a maximum distance profile. Our construction is based on the theory of skew polynomials.
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 in the Hamming metric. This allows to construct twisted linearized Reed-Solomon codes, a new family of maximum sum-rank distance codes extending at the same time Sheekey's twisted Gabidulin codes in the rank metric and twisted Reed-Solomon codes in the Hamming metric. Furthermore, we provide an analogue in the sum-rank metric of Trombetti-Zhou construction,…
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.
