Let $D$ be a division algebra, finite-dimensional over its center, and $R=D[t;\sigma,\delta]$ a skew polynomial ring.Using skew polynomials $f\in R$, we construct division algebras and maximum rank distance codes consisting of matrices with entries in a noncommutative division algebra or field. These include Jha Johnson semifields, and the classes of classical and twisted Gabidulin codes constructed by Sheekey
Left and right idealizers are important invariants of linear rank-distance codes. In the case of max...
Abstract. In previous works we considered codes defined as ideals of quotients of skew polynomial ri...
For any admissible value of the parameters (n) and (k) there exist ([n,k])-Maximum Rank distance ({m...
Let D be a division algebra, finite-dimensional over its center, and R=D[t;σ,δ] a skew polynomial ...
In this thesis we give constructions of semifields, often characterized as not necessarily associati...
In the first part of the thesis, we generalize a construction by J Sheekey that employs skew polynom...
In this paper we generalize the notion of cyclic code and construct codes as ideals in finite quotie...
International audienceWe generalize the construction of linear codes via skew polynomial rings by us...
Let S be a unital ring, S[t; σ, δ] a skew polynomial ring where σ is an injective endomorphism and δ...
Skew polynomial rings are used to construct finite semifields, following from a construction of Ore ...
Algebraic linear codes J/I ⊂ Fq[X1,. .. Xm]/I that are finite dimension quotients of multivariate po...
International audienceIn this work the de nition of codes as modules over skew polynomial rings of a...
Abstract. In this paper we generalize coding theory of cyclic codes over finite fields to skew polyn...
In this paper we study a special type of quasi-cyclic (QC) codes called skew QC codes. This set of c...
In analogy to cyclic codes, we study linear codes over finite fields obtained from left ideals in a ...
Left and right idealizers are important invariants of linear rank-distance codes. In the case of max...
Abstract. In previous works we considered codes defined as ideals of quotients of skew polynomial ri...
For any admissible value of the parameters (n) and (k) there exist ([n,k])-Maximum Rank distance ({m...
Let D be a division algebra, finite-dimensional over its center, and R=D[t;σ,δ] a skew polynomial ...
In this thesis we give constructions of semifields, often characterized as not necessarily associati...
In the first part of the thesis, we generalize a construction by J Sheekey that employs skew polynom...
In this paper we generalize the notion of cyclic code and construct codes as ideals in finite quotie...
International audienceWe generalize the construction of linear codes via skew polynomial rings by us...
Let S be a unital ring, S[t; σ, δ] a skew polynomial ring where σ is an injective endomorphism and δ...
Skew polynomial rings are used to construct finite semifields, following from a construction of Ore ...
Algebraic linear codes J/I ⊂ Fq[X1,. .. Xm]/I that are finite dimension quotients of multivariate po...
International audienceIn this work the de nition of codes as modules over skew polynomial rings of a...
Abstract. In this paper we generalize coding theory of cyclic codes over finite fields to skew polyn...
In this paper we study a special type of quasi-cyclic (QC) codes called skew QC codes. This set of c...
In analogy to cyclic codes, we study linear codes over finite fields obtained from left ideals in a ...
Left and right idealizers are important invariants of linear rank-distance codes. In the case of max...
Abstract. In previous works we considered codes defined as ideals of quotients of skew polynomial ri...
For any admissible value of the parameters (n) and (k) there exist ([n,k])-Maximum Rank distance ({m...