International audienceIn this paper we propose two methods to produce block codes of prescribed rank or distance. Following [4, 5] we work with skew polynomial rings of automorphism type and the codes we investigate are ideals in quotients of this ring. There is a strong connection with linear difference operators and with linearized polynomials (or q-polynomials) which is reviewed in the first section
This thesis studies the theory of error-correcting codes based on evaluation of skew polynomials. Sk...
International audienceWe transpose the theory of rank metric and Gabidulin codes to the case of fiel...
Abstract. In this paper we generalize coding theory of cyclic codes over finite fields to skew polyn...
In this paper we generalize the notion of cyclic code and construct codes as ideals in finite quotie...
International audienceIn this work the de nition of codes as modules over skew polynomial rings of a...
We generalize the notion of cyclic code and we construct codes as ideals in finite quotients of non-...
In this thesis we give constructions of semifields, often characterized as not necessarily associati...
AbstractIn analogy to cyclic codes, we study linear codes over finite fields obtained from left idea...
International audienceThe construction of cyclic codes can be generalized to so called module $\thet...
Let D be a division algebra, finite-dimensional over its center, and R=D[t;σ,δ] a skew polynomial ...
International audienceWe generalize the notion of cyclic codes by using generator polynomials in (no...
In analogy to cyclic codes, we study linear codes over finite fields obtained from left ideals in a ...
In this paper we study a special type of quasi-cyclic (QC) codes called skew QC codes. This set of c...
In this paper, we study linear spaces of matrices defined over discretely valued fields and discuss ...
In this paper, a Roos like bound on the minimum distance for skew cyclic codes over a general field ...
This thesis studies the theory of error-correcting codes based on evaluation of skew polynomials. Sk...
International audienceWe transpose the theory of rank metric and Gabidulin codes to the case of fiel...
Abstract. In this paper we generalize coding theory of cyclic codes over finite fields to skew polyn...
In this paper we generalize the notion of cyclic code and construct codes as ideals in finite quotie...
International audienceIn this work the de nition of codes as modules over skew polynomial rings of a...
We generalize the notion of cyclic code and we construct codes as ideals in finite quotients of non-...
In this thesis we give constructions of semifields, often characterized as not necessarily associati...
AbstractIn analogy to cyclic codes, we study linear codes over finite fields obtained from left idea...
International audienceThe construction of cyclic codes can be generalized to so called module $\thet...
Let D be a division algebra, finite-dimensional over its center, and R=D[t;σ,δ] a skew polynomial ...
International audienceWe generalize the notion of cyclic codes by using generator polynomials in (no...
In analogy to cyclic codes, we study linear codes over finite fields obtained from left ideals in a ...
In this paper we study a special type of quasi-cyclic (QC) codes called skew QC codes. This set of c...
In this paper, we study linear spaces of matrices defined over discretely valued fields and discuss ...
In this paper, a Roos like bound on the minimum distance for skew cyclic codes over a general field ...
This thesis studies the theory of error-correcting codes based on evaluation of skew polynomials. Sk...
International audienceWe transpose the theory of rank metric and Gabidulin codes to the case of fiel...
Abstract. In this paper we generalize coding theory of cyclic codes over finite fields to skew polyn...
DOI
Add to ORKG