English
Related papers

Related papers: Self-dual Repeated Root Cyclic and Negacyclic Code…

200 papers

The cyclic codes with parity check polynomial the reciprocal of the characteristic polynomial of the Fibonacci recurrence over a prime finite field are shown to have either one weight or two weights. When these codes are irreducible cyclic…

Information Theory · Computer Science 2017-09-15 Minjia Shi , Zhongyi Zhang , Patrick Sole

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

MDS codes and self-dual codes are important families of classical codes in coding theory. It is of interest to investigate MDS self-dual codes. The existence of MDS self-dual codes over finite field $F_q$ is completely solved for $q$ is…

Information Theory · Computer Science 2022-08-30 Ruhao Wan , Shixin Zhu , Jin Li

In this paper, we develop the theory for constructing DNA cyclic codes of odd length over $R=\Z_4[u]/\langle u^2-1 \rangle$ based on the deletion distance. Firstly, we relate DNA pairs with a special 16 elements of ring $R$. Cyclic codes of…

Information Theory · Computer Science 2016-03-15 Sukhamoy Pattanayak , Abhay Kumar Singh

This article studies one-generator and two-generator quasi-cyclic codes over finite fields. We present two versions of necessary and sufficient conditions for the symplectic selforthogonality of one-generator quasi-cyclic codes, using both…

Information Theory · Computer Science 2024-12-19 Tushar Bag , Hai Q Dinh , Daniel Panario

Determining the weight distribution of a linear code is a classical and fundamental topic in coding theory that has been extensively investigated. Repeated-root cyclic codes, which form a significant subclass of error-correcting codes, have…

Information Theory · Computer Science 2025-08-07 Wei Zhao , Weixian Li , Shenghao Yang , Fang-Wei Fu , Kenneth W. Shum

Linear codes with complementary-duals (LCD) are linear codes that intersect with their dual trivially. Multinegacirculant codes of index $2$ that are LCD are characterized algebraically and some good codes are found in this family. Exact…

Information Theory · Computer Science 2017-03-10 Adel Alahmadi , Cem Güneri , Buket Özkaya , Hatoon Shoaib , Patrick Solé

MDS self-dual codes over finite fields have attracted a lot of attention in recent years by their theoretical interests in coding theory and applications in cryptography and combinatorics. In this paper we present a series of MDS self-dual…

Information Theory · Computer Science 2019-11-14 Aixian Zhang , Keqin Feng

Symbol-pair codes are proposed to protect against pair errors in symbol-pair read channels. One of the most important task in symbol-pair coding theory is to determine the minimum pair-distance of symbol-pair codes. In this paper, we…

Information Theory · Computer Science 2016-07-08 Shixin Zhu , Zhonghua Sun , Liqi Wang

Let $\mathbb{F}_{p^m}$ be the field containing $p^m$ elements where $p$ is an odd prime and $m \in \mathbb{N}$. In this article, we propose a unified approach to the study of skew constacyclic codes of length $np^s$ over the ring $R_k =…

Information Theory · Computer Science 2026-05-18 Seema Chahal , Seema Antil , Sugandha Maheshwary , Manju Khan

In this paper we study the structure of $\theta$-cyclic codes over the ring $B_k$ including its connection to quasi-$\tilde{\theta}$-cyclic codes over finite field $\mathbb{F}_{p^r}$ and skew polynomial rings over $B_k.$ We also…

Combinatorics · Mathematics 2017-05-18 Irwansyah , Aleams Barra , Intan Muchtadi-Alamsyah , Ahmad Muchlis , Djoko Suprijanto

We study the construction of quasi-cyclic self-dual codes, especially of binary cubic ones. We consider the binary quasi-cyclic codes of length 3\ell with the algebraic approach of [9]. In particular, we improve the previous results by…

Number Theory · Mathematics 2017-06-26 Pınar Çomak , Jon-Lark Kim , Ferruh Özbudak

Polycyclic codes offer a natural generalization of cyclic codes and provide a broader algebraic framework for constructing linear codes with good parameters. In this paper, we study binary polycyclic codes associated with powers of…

Information Theory · Computer Science 2026-05-13 Sujata Bansal , Pramod Kumar Kewat

Let $\mathbb F_q$ be a finite field, where $q$ is an odd prime power. Let $R=\mathbb{F}_q+u\mathbb{F}_q+v\mathbb{F}_q+uv\mathbb F_q$ with $u^2=u,v^2=v,uv=vu$. In this paper, we study the algebraic structure of $(\theta, \Theta)$-cyclic…

Information Theory · Computer Science 2024-04-02 Awadhesh Kumar Shukla , Sachin Pathak , Om Prakash Pandey , Vipul Mishra , Ashish Kumar Upadhyay

In this paper we obtain at least 61 new singly even (Type I) binary [72,36,12] self-dual codes as a quasi-cyclic codes with m=2 (tailbitting convolutional codes) and at least 13 new doubly even (Type II) binary [72,36,12] self-dual codes by…

Information Theory · Computer Science 2017-05-17 Alexandre Zhdanov

BCH codes are an important class of linear codes and find extensive utilization in communication and disk storage systems.This paper mainly analyzes the negacyclic BCH code and cyclic BCH code of length $\frac{q^m-1}{2}$. For negacyclic BCH…

Information Theory · Computer Science 2024-07-02 Mengchen Lian

This paper contributes to construct double circulant self-dual codes by sextic cyclotomy. Generator matrixes of a family of pure double circulant codes and a family of double circulant codes with boundary are formed from sextic cyclotomic…

Information Theory · Computer Science 2020-06-16 Tongjiang Yan , Tao Wang , Wenpeng Gao , Xvbo Zhao

Let $m\geq 3$ be an odd integer and $p$ be an odd prime. % with $p-1=2^rh$, where $h$ is an odd integer. In this paper, many classes of three-weight cyclic codes over $\mathbb{F}_{p}$ are presented via an examination of the condition for…

Information Theory · Computer Science 2013-08-28 Chunlei Li , Nian Li , Tor Helleseth , Cunsheng Ding

For a prime $p$, let $F_q$ be the finite field of order $q= p^d$. This paper presents the study on skew generalized quasi-cyclic (SGQC) codes of length $n$ over the non-chain ring $F_q+vF_q$ where $v^2=v$ and $\theta_t$ is the Galois…

Information Theory · Computer Science 2025-04-29 Kundan Suxena , Indibar Debnath , Om Prakash

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…

Information Theory · Computer Science 2024-12-03 Cunsheng Ding