English
Related papers

Related papers: The reversible negacyclic codes over finite fields

200 papers

In coding theory, a very interesting problem (but at the same time, a very difficult one) is to determine the weight distribution of a given code. This problem is even more interesting for cyclic codes, and this is so, mainly because they…

Information Theory · Computer Science 2016-06-29 Gerardo Vega

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…

Information Theory · Computer Science 2012-05-30 Morgan Barbier , Christophe Chabot , Guillaume Quintin

Let $\texttt{R}$ be a commutative finite chain ring of invariants $(q,s).$ In this paper, the trace representation of any free cyclic $\texttt{R}$-linear code of length $\ell,$ is presented, via the $q$-cyclotomic cosets modulo $\ell,$ when…

Information Theory · Computer Science 2017-02-06 Alexandre Fotue Tabue , Christophe Mouaha

The study of permutation automorphism groups of cyclic codes is a central topic in algebraic coding theory. A cyclic code over $\mathbb{F}_q$ is called irreducible if its check polynomial is irreducible over $\mathbb{F}_q$. Such a code is…

Combinatorics · Mathematics 2026-03-03 Tao Feng , Henk D. L. Hollmann , Weicong Li , Qing Xiang

We give the structure of $\lambda$-constacyclic codes of length $p^sm$ over $R=\mathbb{F}_{p^r}+u \mathbb{F}_{p^r}+...+ u^{e-1}\mathbb{F}_{p^r}$ with $\lambda \in \F_{p^r}^*$. We also give the structure of $\lambda$-constacyclic codes of…

Information Theory · Computer Science 2012-12-03 Kenza Guenda , T. Aaron Gulliver

In this article, we study the skew cyclic codes over R_{k}=F_{p}+uF_{p}+\dots +u^{k-1}F_{p} of length n. We characterize the skew cyclic codes of length $n$ over R_{k} as free left R_{k}[x;\theta]-submodules of R_{k}[x;\theta]/\langle…

Information Theory · Computer Science 2018-02-26 Om Prakash , Habibul Islam

In this paper, a family of reducible cyclic codes over GF(p) whose duals have four zeros is presented, where p is an odd prime. Furthermore, the weight distribution of these cyclic codes is determined.

Information Theory · Computer Science 2014-04-09 Yan Liu

In this paper, we study a family of constacyclic BCH codes over $\mathbb{F}_{q^2}$ of length $n=\frac{q^{2m}-1}{q+1}$, where $q$ is a prime power, and $m\geq2$ an even integer. The maximum design distance of narrow-sense Hermitian…

Information Theory · Computer Science 2020-07-28 X. Zhao , X. Li , Q. Wang , T. Yan

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…

Information Theory · Computer Science 2016-01-01 Giuliano Gadioli La Guardia , Marcelo Muniz Silva Alves

Under research for near sixty years, Bose-$\!$Ray-$\!$Chaudhuri-$\!$Hocquenghem(BCH) codes have played increasingly important roles in many applications such as communication systems, data storage and information security. However, the…

Information Theory · Computer Science 2018-12-24 Yang Liu , Ruihu Li , Qiang Fu , Liangdong Lu , Yi Rao

Let $\mathbb{F}_{2^m}$ be a finite field of $2^m$ elements, and $R=\mathbb{F}_{2^m}[u]/\langle u^k\rangle=\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}+\ldots+u^{k-1}\mathbb{F}_{2^m}$ ($u^k=0$) where $k$ is an integer satisfying $k\geq 2$. For any odd…

Information Theory · Computer Science 2019-10-08 Yonglin Cao , Yuan Cao , Fang-Wei Fu

We discuss the properties and the permutation behaviour of the reversed Dickson polynomials of the $(k+1)$-th kind $D_{n,k}(1,x)$ over finite fields. The results in this paper unify and generalize several recently discovered results on…

Number Theory · Mathematics 2016-05-17 Neranga Fernando

Based on cyclic simplex codes, a new construction of a family of 2-generator quasi-cyclic two-weight codes is given. New optimal binary quasi-cyclic [195, 8, 96], [210, 8, 104] and [240, 8, 120] codes, good QC ternary [195, 6, 126], [208,…

Information Theory · Computer Science 2007-07-13 Eric Zhi Chen

Let $q$ be an odd prime and $k$ be a natural number. We show that a finite subset of integers $S$ that does not contain any perfect $q^{th}$ power, contains a $q^{th}$ power residue modulo almost every natural numbers $N$ with at most $k$…

Number Theory · Mathematics 2025-07-17 Bhawesh Mishra , Paolo Santonastaso

BCH codes are an interesting class of cyclic codes due to their efficient encoding and decoding algorithms. In the past sixty years, a lot of progress on the study of BCH codes has been made, but little is known about the properties of…

Information Theory · Computer Science 2023-12-12 Xiaoqiang Wang , Chengliang Xiao , Dabin Zheng

Professor Cunsheng Ding gave cyclotomic constructions of cyclic codes with length being the product of two primes. In this paper, we study the cyclic codes of length $n=2^e$ and dimension $k=2^{e-1}$. Clearly, Ding's construction is not…

Information Theory · Computer Science 2018-08-21 Binbin Pang , Shixin Zhu , Ping Li

The factorizations of the polynomial $X^n-1$ and the cyclotomic polynomial $\Phi_n$ over a finite field $\mathbb F_q$ have been studied for a very long time. Explicit factorizations have been given for the case that $\mathrm{rad}(n)\mid…

Number Theory · Mathematics 2024-02-09 Anna-Maurin Graner

In this paper, we give conditions for the existence of Hermitian self-dual $\Theta-$cyclic and $\Theta-$negacyclic codes over the finite chain ring $\mathbb{F}_q+u\mathbb{F}_q$. By defining a Gray map from $R=\mathbb{F}_q+u\mathbb{F}_q$ to…

Information Theory · Computer Science 2019-03-20 Zineb Hebbache , Kenza Guenda , N. Tugba Özzaim , Mehmet Özen , T. Aaron Gulliver

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

A method to construct and count all the linear codes (of arbitrary length) in $\mathbb{F}_{4}$ that are invariant under reverse permutation and that contain the repetition code is presented. These codes are suitable for constructing DNA…

Information Theory · Computer Science 2025-06-25 E. J. García-Claro