Related papers: Spread Codes from Abelian non-cyclic groups
Given a prime power q, for every pair of positive integers m and n with m dividing the GCD of n and q-1, we construct a modular curve over F_q that parametrizes elliptic curves over F_q along with F_q-defined points P and Q of order m and…
An affine spread is a set of subspaces of $\mathrm{AG}(n, q)$ of the same dimension that partitions the points of $\mathrm{AG}(n, q)$. Equivalently, an {\em affine spread} is a set of projective subspaces of $\mathrm{PG}(n, q)$ of the same…
In this paper, we construct an infinite family of three-weight binary codes from linear codes over the ring $R=\mathbb{F}_2+v\mathbb{F}_2+v^2\mathbb{F}_2$, where $v^3=1.$ These codes are defined as trace codes. They have the algebraic…
In this paper we propose a heuristic technique for distributing points on the surface of a unit n-dimensional Euclidean sphere, generated as the orbit of a finite cyclic subgroup of orthogonal matrices, the so called cyclic group codes.…
Let $q$ be a prime power. This paper provides a new class of linear codes that arises from the action of the alternating group on $\mathbb F_q[x_1,\dots,x_m]$ combined with the ideas in (M. Datta and T. Johnsen, 2022). Compared with…
In this article, we introduce and study the concept of the exponent of a cyclic code over a finite field $\mathbb{F}_q.$ We give a relation between the exponent of a cyclic code and its dual code. Finally, we introduce and determine the…
In this work, we study cyclic codes that have generators as Fibonacci polynomials over finite fields. We show that these cyclic codes in most cases produce families of maximum distance separable and optimal codes with interesting…
In network coding a constant dimension code consists of a set of k-dimensional subspaces of F_q^n. Orbit codes are constant dimension codes which are defined as orbits of a subgroup of the general linear group, acting on the set of all…
Recently, many good quantum codes over various finite fields $F_q$ have been constructed from codes over extension rings or mixed alphabet rings via some version of a Gray map. We show that most of these codes can be obtained more directly…
Let $p$ be an odd prime. Let $F/k$ be a cyclic extension of degree $p$ and of characteristic different from $p$. The explicit constructions of the non-abelian $p^{3}$-extensions over $k$, are induced by certain elements in…
In the paper "An Abelian Loop for Non-Composites" (arXiv:110.14716), we introduced a group-like structure consisting of odd prime numbers and 1, with properties that allowed us to prove analogous results to well known theorems in Number…
The paper presents a comprehensive study of group codes from non-abelian split metacyclic group algebras. We derive an explicit Wedderburn-like decomposition of finite split metacyclic group algebras over fields with characteristic coprime…
A spread code is a set of vector spaces of a fixed dimension over a finite field Fq with certain properties used for random network coding. It can be constructed in different ways which lead to different decoding algorithms. In this work we…
We investigate additive cyclic codes over the alphabet $\mathbb{F}_{q}\mathbb{F}_{q^2}$, where $q$ is a prime power. First, its generator polynomials and minimal spanning set are determined. Then, examples of $\mathbb{F}_{q^2}$-additive…
There is a one-to-one correspondence between $\ell$-quasi-cyclic codes over a finite field $\mathbb F_q$ and linear codes over a ring $R = \mathbb F_q[Y]/(Y^m-1)$. Using this correspondence, we prove that every $\ell$-quasi-cyclic self-dual…
Quasi-cyclic codes have been recently employed in the constructions of quantum error-correcting codes. In this paper, we propose a construction of infinite families of quasi-cyclic codes over $\F_q$ which are self-orthogonal with respect to…
Let $\mathbb{F}_q$ be a finite field of order $q$, a prime power integer such that $q=et+1$ where $t\geq 1,e\geq 2$ are integers. In this paper, we study cyclic codes of length $n$ over a non-chain ring $R_{e,q}=\mathbb{F}_q[u]/\langle…
In this paper, several infinite families of codes over the extension of non-unital non-commutative rings are constructed utilizing general simplicial complexes. Thanks to the special structure of the defining sets, the principal parameters…
Recently, constructions of optimal linear codes from simplicial complexes have attracted much attention and some related nice works were presented. Let $q$ be a prime power. In this paper, by using the simplicial complexes of ${\mathbb…
In this note, we give a construction of codes on algebraic function field $F/ \mathbb{F}_{q}$ using places of $F$ (not necessarily of degree one) and trace functions from various extensions of $\mathbb{F}_{q}$. This is a generalization of…