Related papers: Non-Invertible-Element Constacyclic Codes over Fin…

Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. Perfect nonlinear monomials were employed to…

The goal of this paper is to establish fundamental properties of the Hochschild, topological Hochschild, and topological cyclic homologies of commutative, Noetherian rings, which are assumed only to be F-finite in the majority of our…

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…

Cyclic codes have efficient encoding and decoding algorithms over finite fields, so that they have practical applications in communication systems, consumer electronics and data storage systems. The objective of this paper is to give eight…

We determine the asymptotic proportion of free modules over finite chain rings with good distance properties and treat the asymptotics in the code length n and the residue field size q separately. We then specialize and apply our technique…

In this paper we study a special type of quasi-cyclic (QC) codes called skew QC codes. This set of codes is constructed using a non-commutative ring called the skew polynomial rings $F[x;\theta ]$. After a brief description of the skew…

Two nonconforming finite element Stokes complexes starting from the conforming Lagrange element and ending with the nonconforming $P_1$-$P_0$ element for the Stokes equation in three dimensions are constructed. And commutative diagrams are…

Let $R$ be a commutative ring. If the nilpotent radical $Nil(R)$ of $R$ is a divided prime ideal, then $R$ is called a $\phi$-ring. In this paper, we first distinguish the classes of nonnil-coherent rings and $\phi$-coherent rings…

Let $R^t$ denote the finite chain ring $\frac{\mathbb{F}_{p^m}[u]}{\langle u^t \rangle},$ where $p$ is a prime and $t$ is a positive integer. In this article, for a prime $p$ and an automorphism $\theta$ of $\mathbb{F}_{p^m}$, we give the…

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…

Constacyclic codes contain cyclic codes as a subclass and have nice algebraic structures. Constacyclic codes have theoretical importance, as they are connected to a number of areas of mathematics and outperform cyclic codes in several…

We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…

Let \(\cU\) be the multiplicative group of order~\(n\) in the splitting field \(\bbF_{q^m}\) of \(x^n-1\) over the finite field \(\bbF_q\). Any map of the form \(x\rightarrow cx^t\) with \(c\in \cU\) and \(t=q^i\), \(0\leq i<m\), is…

This paper considers a new alphabet set, which is a ring that we call $\mathbb{F}_4R$, to construct linear error-control codes. Skew cyclic codes over the ring are then investigated in details. We define a nondegenerate inner product and…

Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A…

Additive cyclic codes over Galois rings were investigated in previous works. In this paper, we investigate the same problem but over a more general ring family, finite commutative chain rings. When we focus on non-Galois finite commutative…

The problem of linking the structure of a finite linear dynamical system with its dynamics is well understood when the phase space is a vector space over a finite field. The cycle structure of such a system can be described by the…

Let p>3 be an odd prime and m be a positive integer. Little progress on the study of optimal p-ary cyclic codes with parameters [p^m-1,p^m-2m-2,4] has been made.In this paper, by weakening the necessary and sufficient conditions on cyclic…

In this paper, we mainly study the theory of linear codes over the ring $R =\mathbb{Z}_4+u\mathbb{Z}_4+v\mathbb{Z}_4+uv\mathbb{Z}_4$. By the Chinese Remainder Theorem, we have $R$ is isomorphic to the direct sum of four rings…

Let $\mathbb{F}_p$ denote the finite field of order $p$, where $p$ is an odd prime. We study certain quantum negacyclic codes over $\mathbb{F}_p$ which we call $t$-Frobenius negacyclic codes. We obtain a criterion for constructing such…