English
Related papers

Related papers: One-Sided Repeated-Root Two-Dimensional Cyclic and…

200 papers

Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields are studied. An algorithm for factorizing $x^n-\lambda$ over $\mathbb{F}_{q^2}$ is given, where $\lambda$ is a unit in $\mathbb{F}_{q^2}$. Based on this…

Rings and Algebras · Mathematics 2016-01-05 Ekkasit Sangwisut , Somphong Jitman , Patanee Udomkavanich

Locally recoverable (LRC) codes and their variants have been extensively studied in recent years. In this paper we focus on cyclic constructions of LRC codes and derive conditions on the zeros of the code that support the property of…

Information Theory · Computer Science 2020-04-16 Zitan Chen , Alexander Barg

Double polycirculant codes are introduced here as a generalization of double circulant codes. When the matrix of the polyshift is a companion matrix of a trinomial, we show that such a code is isodual, hence formally self-dual. Numerical…

Cryptography and Security · Computer Science 2020-03-31 Minjia Shi , Li Xu , Patrick Sole

Binary duadic codes are an interesting subclass of cyclic codes since they have large dimensions and their minimum distances may have a square-root bound. In this paper, we present several families of binary duadic codes of length $2^m-1$…

Information Theory · Computer Science 2023-02-28 Hai Liu , Chengju Li , Haifeng Qian

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in…

Information Theory · Computer Science 2023-01-18 Hai Liu , Chengju Li , Cunsheng Ding

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. In this paper, monomials and trinomials over…

Information Theory · Computer Science 2013-10-08 Cunsheng Ding , Zhengchun Zhou

Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F[x]/(x^n-1), where F is a finite field. If this automorphism itself has certain specific cyclicity properties one is lead to the class of…

Rings and Algebras · Mathematics 2007-07-16 Heide Gluesing-Luerssen , Wiland Schmale

General isometries of cyclic codes, including multipliers and translations, are introduced; and isometrically self-dual cyclic codes are defined. In terms of Type-I duadic splittings given by multipliers and translations, a necessary and…

Information Theory · Computer Science 2016-10-05 Yun Fan , Liang Zhang

The dual of the Kasami code of length $q^2-1$, with $q$ a power of $2$, is constructed by concatenating a cyclic MDS code of length $q+1$ over $F_q$ with a Simplex code of length $q-1$. This yields a new derivation of the weight…

Information Theory · Computer Science 2023-06-28 Minjia Shi , Denis Krotov , Patrick Solé

In this paper, we study the codes over the matrix ring over $\mathbb{Z}_4$, which is perhaps the first time the ring structure $M_2(\mathbb{Z}_4)$ is considered as a code alphabet. This ring is isomorphic to…

Information Theory · Computer Science 2018-07-16 Sanjit Bhowmick , Satya Bagchi , Ramakrishna Bandi

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.…

Information Theory · Computer Science 2024-01-08 Ziling Heng , Xiaoru Li , Yansheng Wu , Qi Wang

Let $\mathcal{R}=\mathbb{F}_{p}+u\mathbb{F}_{p}+u^2\mathbb{F}_{p}+u^3\mathbb{F}_{p}$ with $u^4=u$ be a finite non-chain ring, where $p$ is a prime congruent to $1$ modulo $3$. In this paper we study $(1-2u^3)$-constacyclic codes over the…

Number Theory · Mathematics 2016-03-11 Madhu Raka , Leetika Kathuria , Mokshi Goyal

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…

Information Theory · Computer Science 2023-03-15 Disha , Sucheta Dutt

We introduce circulant matrices that capture the structure of a skew-polynomial ring F[x;\theta] modulo the left ideal generated by a polynomial of the type x^n-a. This allows us to develop an approach to skew-constacyclic codes based on…

Information Theory · Computer Science 2014-09-30 Neville Fogarty , Heide Gluesing-Luerssen

For any constacyclic code over a finite commutative chain ring of length coprime to the characteristic of the ring, we construct explicitly generator polynomials and check polynomials, and exhibit a BCH bound for such constacyclic codes. As…

Information Theory · Computer Science 2021-05-21 Yun Fan

We show that there are good long binary generalized quasi-cyclic self-dual (either Type I or Type II) codes.

Information Theory · Computer Science 2016-01-12 MinJia Shi , Yan Liu , Patrick Solé

In this study, in order to get better codes, we focus on double skew cyclic codes over the ring $\mathrm{R}= \mathbb{F}_q+v\mathbb{F}_q, ~v^2=v$ where $q$ is a prime power. We investigate the generator polynomials, minimal spanning sets,…

Information Theory · Computer Science 2024-05-14 Ashutosh Singh , Tulay Yildirim , Om Prakash

In this paper, we study the structure of cyclic, quasi-cyclic, constacyclic codes and their skew codes over the finite ring R=Z_3+vZ_3+v^2Z_3, v^3=v. The Gray images of cyclic, quasi-cyclic, skew cyclic, skew quasi-cyclic and skew…

Information Theory · Computer Science 2018-11-09 Abdullah Dertli , Yasein Cengellenmis , Senol Eren

We study constacyclic codes, of length $np^s$ and $2np^s$, that are generated by the polynomials $(x^n + \gamma)^{\ell}$ and $(x^n - \xi)^i(x^n + \xi)^j$\ respectively, where $x^n + \gamma$, $x^n - \xi$ and $x^n + \xi$ are irreducible over…

Information Theory · Computer Science 2009-06-23 Hakan Ozadam , Ferruh Ozbudak

The problem of identifying whether the family of cyclic codes is asymptotically good or not is a long-standing open problem in the field of coding theory. It is known in the literature that some families of cyclic codes such as BCH codes…

Information Theory · Computer Science 2017-05-30 Arti Yardi , Ruud Pellikaan