Related papers: Additive cyclic codes over finite commutative chai…

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…

One formidable difficulty in quantum communication and computation is to protect information-carrying quantum states against undesired interactions with the environment. In past years, many good quantum error-correcting codes had been…

In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and…

In this paper, we develop the theory of convolutional codes over finite commutative chain rings. In particular, we focus on maximum distance profile (MDP) convolutional codes and we provide a characterization of these codes, generalizing…

Cyclic codes over finite fields are widely implemented in data storage systems, communication systems, and consumer electronics, as they have very efficient encoding and decoding algorithms. They are also important in theory, as they are…

This paper proposes a new family of recursive systematic convolutional codes, defined in the non-binary domain over different Galois fields GF(q) and intended to be used as component codes for the design of non-binary turbo codes. A general…

Galois closures of commutative rank n ring extensions were introduced by Bhargava and the second author. In this paper, we generalize the construction to the case of non-commutative rings. We show that non-commutative Galois closures…

We present a deterministic polynomial-time algorithm that determines whether a finite module over a finite commutative ring is cyclic, and if it is, outputs a generator.

Let $R$ be a finite commutative chain ring, $D_{2n}$ be the dihedral group of size $2n$ and $R[D_{2n}]$ be the dihedral group ring. In this paper, we completely characterize left ideals of $R[D_{2n}]$ (called left $D_{2n}$-codes) when ${\rm…

We study the inverse Galois problem with local conditions. In particular, we ask whether every finite group occurs as the Galois group of a Galois extension of $\mathbb{Q}$ all of whose decomposition groups are cyclic (resp., abelian). This…

This paper considers cyclic DNA codes of arbitrary length over the ring $R=\F_2[u]/u^4-1$. A mapping is given between the elements of $R$ and the alphabet $\{A,C,G,T\}$ which allows the additive stem distance to be extended to this ring.…

Let $R=\mathbb{F}_2+u\mathbb{F}_2+u^2\mathbb{F}_2$ be a non-chain finite commutative ring, where $u^3=u$. In this paper, we mainly study the construction of quantum codes from cyclic codes over $R$. We obtained self-orthogonal codes over…

Let k be a perfect field and A a finite dimensional k-algebra of finite global dimension (e.g. the path algebra of a finite quiver without oriented cycles). Making use of the recent theory of noncommutative motives, we prove that the value…

Let $f(u)$ and $g(v)$ be any two polynomials of degree $k$ and $\ell$ respectively ($k$ and $\ell$ are not both $1$), which split into distinct linear factors over $\mathbb{F}_{q}$. Let $\mathcal{R}=\mathbb{F}_{q}[u,v]/\langle…

Graphs defined over a finite ring are well-studied in the literature. Due to their nature, these types of graphs connect several branches of mathematics, including algebra, number theory, matrix theory, and representation theory. In recent…

In this paper we initiate the study of cyclic algebraic geometry codes. We give conditions to construct cyclic algebraic geometry codes in the context of algebraic function fields over a finite field by using their group of automorphisms.…

Based on good algebraic structures and practicabilities, generalized quasi-cyclic (GQC) codes play important role in coding theory. In this paper, we study some results on GQC codes over $\mathbb{Z}_4$ including the normalized generating…

Generalized quasi-cyclic (GQC) codes with arbitrary lengths over the ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $u^2=0$, $q=p^n$, $n$ a positive integer and $p$ a prime number, are investigated. By the Chinese Remainder Theorem,…

In this paper, we explore a ring invariant which is closely related to the Davenport constant of a group. In particular, we will calculate this invariant for a certain class of rings of integers and their orders and use it to understand…

Let $R$ be a commutative local finite ring. In this paper, we construct the complete set of pairwise orthogonal primitive idempotents of $R[X]/<g>$ where $g$ is a regular polynomial in $R[X]$. We use this set to decompose the ring…