Related papers: On cyclic algebraic-geometry codes
Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this…
This paper focuses on polynomial dynamical systems over finite fields. These systems appear in a variety of contexts, in computer science, engineering, and computational biology, for instance as models of intracellular biochemical networks.…
A finite group with a cyclic normal subgroup N such that G/N is cyclic is said to be metacyclic. A code over a finite field F is a metacyclic code if it is a left ideal in the group algebra FG for G a metacyclic group. Metacyclic codes are…
An equivalence relation called isometry is introduced to classify constacyclic codes over a finite field; the polynomial generators of constacyclic codes of length $\ell^tp^s$ are characterized, where $p$ is the characteristic of the finite…
This paper considers the construction of isodual quasi-cyclic codes. First we prove that two quasi-cyclic codes are permutation equivalent if and only if their constituent codes are equivalent. This gives conditions on the existence of…
We propose a unified method to construct multicyclic codes of arbitrary dimension $r$ over $\mathbb{F}_q$. The approach relies on $r$-dimensional primitive idempotents defined as tensor products of univariate ones, combined with…
The aim of this paper is to determine the algebraic structure of multidimensional cyclic codes over a finite chain ring $\mathfrak{R}$. An algorithm to find the generator polynomials of $n$ dimensional ($n$D) cyclic codes of length…
In this paper we will give an explicit construction of the geometric model for a prescribed extension of a function field in several variables over a number field. As a by-product, we will also prove the existence of quasi-galois closed…
In this paper, for a given finitely generated algebra (an algebraic structure with arbitrary operations and no predicates) A we study finitely generated limit algebras of A, approaching them via model theory and algebraic geometry. Along…
We consider linear cyclic codes with the locality property, or locally recoverable codes (LRC codes). A family of LRC codes that generalizes the classical construction of Reed-Solomon codes was constructed in a recent paper by I. Tamo and…
We show that the cyclic and epicyclic categories which play a key role in the encoding of cyclic homology and the lambda operations, are obtained from projective geometry in characteristic one over the infinite semifield F of "max-plus…
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 previous work we determined automorphism groups of cyclic algebraic curves defined over fields of any odd characteristic. In this paper we determine parametric equations of families of curves for each automorphism group for such curves.
In coding theory, constructing codes with good parameters is one of the most important and fundamental problems. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes equal to prime powers.…
In an interesting paper Professor Cunsheng Ding provided three constructions of cyclic codes of length being a product of two primes. Numerical data shows that many codes from these constructions are best cyclic codes of the same length and…
In this paper, we study some repeated-root two-dimensional cyclic and constacyclic codes over a finite field $F=\mathbb{F}_q$. We obtain the generator matrices and generator polynomials of these codes and their duals. We also investigate…
In this article, for a finite field $\mathbb{F}_q$ and a natural number $l,$ let $\mathcal{R}$ denote the product ring $\mathbb{F}_q^l.$ Firstly, for an automorphism $\Theta$ of $\mathcal{R},$ a $\Theta$-derivation $\Delta_\Theta$ of…
Cylindrical algebraic decomposition is a classical construction in real algebraic geometry. Although there are many algorithms to compute a cylindrical algebraic decomposition, their practical performance is still very limited. In this…
This paper introduces new constructions of sum-rank metric codes derived from algebraic function fields, as existing results on such codes remain limited. A major challenge lies in the determination of their parameters. We address this…
Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and…