A constant dimension code consists of a set of k-dimensional subspaces of Fnq, where Fq is a finite field of q elements. Orbit codes are constant dimension codes which are defined as orbits under the action of a subgroup of the general linear group on the set of all k-dimensional subspaces of Fnq. If the acting group is Abelian, we call the corresponding orbit code Abelian orbit code. In this paper we present a construction of an Abelian non-cyclic orbit code for which we compute its cardinality and its minimum subspace distance. Our code is a partial spread and consequently its minimum subspace distance is maximal.This work was partially supported by Spanish grants AICO/2017/128 of the Generalitat Valenciana and VIGROB287 of the Universita...
In this paper we study flag codes of maximum distance. We characterize these codes in terms of, at m...
Algebraic structure of codes over $F_{q}$, closed under arbitrary abelian group G of permutations wi...
In this paper we construct infinite families of non-linear maximum rank distance codes by using the ...
A constant dimension code consists of a set of k-dimensional subspaces of Fnq, where Fq is a finite ...
In this paper we characterize the orbit codes as geometrically uniform codes. This characterization ...
In network coding, a flag code is a set of sequences of nested subspaces of Fnq, being Fq the finite...
A recent approach for the construction of constant dimension subspace codes, designed for error corr...
Constant dimension codes are subsets of the finite Grassmann variety. The subspace distance is a nat...
Flag codes are multishot network codes consisting of sequences of nested subspaces (flags) of a vect...
Constant dimension codes are subsets of the finite Grassmann variety. The study of these codes is a ...
In this paper we construct different families of orbit codes in the vector spaces of the symmetric b...
AbstractLet d be the minimum distance of an (n, k) code C, invariant under an abelian group acting t...
summary:We investigate a $H$-invariant linear code $C$ over the finite field $F_{p}$ where $H$ is a ...
We propose the use of orbit codes to design storage codesthat is, subspace codes obtained from orbit...
AbstractConstacyclic codes are generalizations of the familiar linear cyclic codes. In this paper co...
In this paper we study flag codes of maximum distance. We characterize these codes in terms of, at m...
Algebraic structure of codes over $F_{q}$, closed under arbitrary abelian group G of permutations wi...
In this paper we construct infinite families of non-linear maximum rank distance codes by using the ...
A constant dimension code consists of a set of k-dimensional subspaces of Fnq, where Fq is a finite ...
In this paper we characterize the orbit codes as geometrically uniform codes. This characterization ...
In network coding, a flag code is a set of sequences of nested subspaces of Fnq, being Fq the finite...
A recent approach for the construction of constant dimension subspace codes, designed for error corr...
Constant dimension codes are subsets of the finite Grassmann variety. The subspace distance is a nat...
Flag codes are multishot network codes consisting of sequences of nested subspaces (flags) of a vect...
Constant dimension codes are subsets of the finite Grassmann variety. The study of these codes is a ...
In this paper we construct different families of orbit codes in the vector spaces of the symmetric b...
AbstractLet d be the minimum distance of an (n, k) code C, invariant under an abelian group acting t...
summary:We investigate a $H$-invariant linear code $C$ over the finite field $F_{p}$ where $H$ is a ...
We propose the use of orbit codes to design storage codesthat is, subspace codes obtained from orbit...
AbstractConstacyclic codes are generalizations of the familiar linear cyclic codes. In this paper co...
In this paper we study flag codes of maximum distance. We characterize these codes in terms of, at m...
Algebraic structure of codes over $F_{q}$, closed under arbitrary abelian group G of permutations wi...
In this paper we construct infinite families of non-linear maximum rank distance codes by using the ...