相关论文: On the Lattice of Cyclic Linear Codes Over Finite …

Let $\texttt{R}$ be a commutative finite chain ring of invariants $(q,s)$ and $\Gamma(\texttt{R})$ the Teichm\"uller's set of $\texttt{R}.$ In this paper, the trace representation cyclic $\texttt{R}$-linear codes of length $\ell,$ is…

Let $R=\mathbb{Z}_q+u\mathbb{Z}_q$, where $q=p^s$ and $u^2=0$. In this paper, some structural properties of cyclic codes over the ring $R$ are considered. A necessary and sufficient condition for cyclic codes over the ring $R$ to be free is…

New properties of $q$-ary cyclotomic cosets modulo $n = q^{m} - 1$, where $q \geq 3$ is a prime power, are investigated in this paper. Based on these properties, the dimension as well as bounds for the designed distance of some families of…

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, we mainly consider quasi-cyclic (QC) codes over finite chain rings. We study module structures and trace representations of QC codes, which lead to some lower bounds on the minimum Hamming distance of QC codes. Moreover, we…

A coding lattice $\Lambda_c$ and a shaping lattice $\Lambda_s$ forms a nested lattice code $\mathcal{C}$ if $\Lambda_s \subseteq \Lambda_c$. Under some conditions, $\mathcal{C}$ is a finite cyclic group formed by rectangular encoding. This…

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…

We construct $\mathbb{Z}_p$-lattices and $\mathbb{F}_q[\![t]\!]$-lattices from cyclic $(f,\sigma)$-codes over finite chain rings, employing quotients of natural nonassociative orders and principal left ideals in carefully chosen…

Due to the wide applications in consumer electronics, data storage systems and communication systems, cyclic codes have been an interesting research topic in coding theory. In this paper, let $p$ be a prime with $p\ge 7$. We determine the…

BCH and LCD cyclic codes of length $n=\lambda(q^m+1)$ with $\lambda\mid q-1$ are studied. A complete characterization of $q$-cyclotomic cosets modulo $n$ is given: Theorem \ref{th4} provides a necessary and sufficient condition for any…

A new bound on the minimum distance of q-ary cyclic codes is proposed. It is based on the description by another cyclic code with small minimum distance. The connection to the BCH bound and the Hartmann--Tzeng (HT) bound is formulated…

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…

For $\lambda$ an $n$-th power of a unit in a finite chain ring we prove that $\lambda$-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some…

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 $p$ be an odd prime and $r,s,m$ be positive integers. In this study, we initiate our exploration by delving into the intricate structure of all repeated-root cyclic codes and their duals with a length of $2^rp^s$ over the finite field…

Generalizing the linear complementary duals, the linear complementary pairs and the hull of codes, we introduce the concept of $\ell$-dimension linear intersection pairs ($\ell$-DLIPs) of codes over a finite commutative ring $(R)$, for some…

Recently, linear codes with a few weights were widely investigated due to their applications in secret sharing schemes and authentication schemes. In this letter, we present a class of $q$-ary linear codes derived from irreducible cyclic…

Families of "asymptotically regular" LDPC block code ensembles can be formed by terminating (J,K)-regular protograph-based LDPC convolutional codes. By varying the termination length, we obtain a large selection of LDPC block code ensembles…

A well-known lower bound (over finite fields and some special finite commutative rings) on the Hamming distance of a matrix-product code (MPC) is shown to remain valid over any commutative ring $R$. A sufficient condition is given, as well,…

Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder…