Related papers: Optimal Ternary Cyclic Codes from Monomials
A class of optimal three-weight cyclic codes of dimension 3 over any finite field was presented by Vega [Finite Fields Appl., 42 (2016) 23-38]. Shortly thereafter, Heng and Yue [IEEE Trans. Inf. Theory, 62(8) (2016) 4501-4513] generalized…
Cyclic codes have wide applications in data storage systems and communication systems. Employing two-prime Whiteman generalized cyclotomic sequences of order 6, we construct several classes of cyclic codes over the finite field GF}(q) and…
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…
Linear codes with a few weights have many nice applications including combinatorial design, distributed storage system, secret sharing schemes and so on. In this paper, we construct two families of linear codes with a few weights based on…
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…
The ring in the title is the first non commutative ring to have been used as alphabet for block codes. The original motivation was the construction of some quaternionic modular lattices from codes. The new application is the construction of…
A class of optimal three-weight cyclic codes of dimension 3 over any finite field was presented by Vega [Finite Fields Appl., 42 (2016) 23-38]. Shortly thereafter, Heng and Yue [IEEE Trans. Inf. Theory, 62(8) (2016) 4501-4513] generalized…
Linear complementary dual (LCD) codes introduced by Massey are the codes whose intersections with their dual codes are trivial. It can help to improve the security of the information processed by sensitive devices, especially against…
The additive codes may have better parameters than linear codes. However, it is still a challenging problem to efficiently construct additive codes that outperform linear codes, especially those with greater distances than linear codes of…
Let $R=\mathbb{Z}_{4}[u]/\langle u^k\rangle=\mathbb{Z}_{4}+u\mathbb{Z}_{4}+\ldots+u^{k-1}\mathbb{Z}_{4}$ ($u^k=0$) where $k\in \mathbb{Z}^{+}$ satisfies $k\geq 2$. For any odd positive integer $n$, it is known that cyclic codes over $R$ of…
A lot of attention has been paid to the investigation of the algebraic properties of linear codes. In most cases, this investigation involves the determination of required code automorphisms, which are useful for decoders, such as the…
Quadratic residue codes have been one of the most important classes of algebraic codes. They have been generalized into duadic codes and quadratic double circulant codes. In this paper we introduce a new subclass of double circulant codes,…
In this work, a unique set of generators for a cyclic code over a finite chain ring has been established. The minimal spanning set and rank of the code have also been determined. Further, sufficient as well as necessary conditions for a…
We describe and present a new construction method for codes using encodings from group rings. They consist primarily of two types: zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; for example cyclic…
Linear codes are widely studied in coding theory as they have nice applications in distributed storage, combinatorics, lattices, cryptography and so on. Constructing linear codes with desirable properties is an interesting research topic.…
Polycyclic codes are a generalization of cyclic and constacyclic codes. Even though they have been known since 1972 and received some attention more recently, there have not been many studies on polycyclic codes. This paper presents an…
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, cyclic codes are established over some finite quaternion integer rings with respect to the quaternion Mannheim distance, and de- coding algorithm for these codes is given.
In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic…
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…