English
Related papers

Related papers: Binary Cyclic Codes from Explicit Polynomials over…

200 papers

In this paper we study the family of cyclic codes such that its minimum distance reaches the maximum of its BCH bounds. We also show a way to construct cyclic codes with that property by means of computations of some divisors of a…

Information Theory · Computer Science 2024-02-07 José Joaquín Bernal , Diana H. Bueno-Carreño , Juan Jacobo Simón

Linear codes are widely studied due to their applications in communication, cryptography, quantum codes, distributed storage and many other fields. In this paper, we use the trace and norm functions over finite fields to construct a family…

Information Theory · Computer Science 2024-04-30 Ziling Heng , Mengjie Yang , Yang Ming

Constacyclic codes over finite fields are a family of linear codes and contain cyclic codes as a subclass. Constacyclic codes are related to many areas of mathematics and outperform cyclic codes in several aspects. Hence, constacyclic codes…

Information Theory · Computer Science 2022-08-29 Zhonghua Sun , Cunsheng Ding , Xiaoqiang Wang

Cyclic codes have been widely used in digital communication systems and consume electronics as they have efficient encoding and decoding algorithms. The weight distribution of cyclic codes has been an important topic of study for many…

Information Theory · Computer Science 2013-01-15 Jing Yang , Maosheng Xiong , Cunsheng Ding

We present new constructions of binary quantum codes from quaternary linear Hermitian self-dual codes. Our main ingredients for these constructions are nearly self-orthogonal cyclic or duadic codes over F_4. An infinite family of…

Information Theory · Computer Science 2022-11-03 Reza Dastbasteh , Petr Lisonek

In this paper, we focus on the design of binary constant weight codes that admit low-complexity encoding and decoding algorithms, and that have a size $M=2^k$. For every integer $\ell \geq 3$, we construct a $(n=2^\ell, M=2^{k_{\ell}},…

Information Theory · Computer Science 2024-07-02 Birenjith Sasidharan , Emanuele Viterbo , Son Hoang Dau

Cyclic codes are an important class of linear codes, whose weight distribution have been extensively studied. So far, most of previous results obtained were for cyclic codes with no more than three zeros. Recently, \cite{Y-X-D12}…

Number Theory · Mathematics 2014-05-27 Jing Yang , Lingli Xia , Maosheng Xiong

In \cite{shi2022few-weight}, Shi and Li studied $\mathcal{C}_D$-codes over the ring $\mathcal{R}:=\mathbb{F}_2[x,y]/\langle x^2, y^2, xy-yx\rangle$ and their binary Gray images, where $D$ is derived using certain simplicial complexes. We…

Information Theory · Computer Science 2025-10-13 Ankit Yadav , Ritumoni Sarma , Anuj Kumar Bhagat

In this paper, we investigate polycyclic codes associated with a trinomial of arbitrary degree $n$ over a finite chain ring $ R.$ We extend the concepts of $ n $-isometry and $ n $-equivalence known for constacyclic codes to this class of…

Information Theory · Computer Science 2025-03-18 Abdelghaffar Chibloun , Hassan Ou-azzou , Edgar Martínez-Moro , Mustapha Najmeddine

Let $r,s,t$ be three positive integers and $\mathcal{C}$ be a binary linear code of lenght $r+s+t$. We say that $\mathcal{C}$ is a triple cyclic code of lenght $(r,s,t)$ over $\mathbb{Z}_2$ if the set of coordinates can be partitioned into…

Information Theory · Computer Science 2015-09-18 Hojjat Mostafanasab

Two general constructions of linear codes with functions over finite fields have been extensively studied in the literature. The first one is given by $\mathcal{C}(f)=\left\{ {\rm Tr}(af(x)+bx)_{x \in \mathbb{F}_{q^m}^*}: a,b \in…

Information Theory · Computer Science 2021-01-22 Xiaoqiang Wang , Dabin Zheng , Cunsheng Ding

In this paper, we will give the generic construction of a binary linear code of dimension $n+3$ and derive the necessary and sufficient conditions for the constructed code to be minimal. Using generic construction, a new family of minimal…

Information Theory · Computer Science 2024-03-21 Wajid M. Shaikh , Rupali S. Jain , B. Surendranath Reddy , Bhagyashri S. Patil

The permutation groups of cyclic codes are widely applicable in determining the weight distribution of codes, decoding theory and various other areas. In this paper, by employing two distinct matrix representations, we can relate cyclic…

Information Theory · Computer Science 2026-05-26 Junjie Huang , Jicheng Ma , Chang-An Zhao

We give a polynomial representation for additive cyclic codes over $\mathbb{F}_{p^2}$. This representation will be applied to uniquely present each additive cyclic code by at most two generator polynomials. We determine the generator…

Information Theory · Computer Science 2023-01-03 Reza Dastbasteh , Khalil Shivji

We introduce a formula for determining the number of codewords of weight 2 in cyclic codes and provide results related to the count of codewords with weight 3. Additionally, we establish a recursive relationship for binary cyclic codes that…

Number Theory · Mathematics 2025-06-03 José G. Coelho , F. E. Brochero Martínez

Based on cyclic and consta-cyclic simplex codes, a new explicit construction of a family of two-weight codes is presented. These two-weight codes obtained are in the form of 2-generator quasi-cyclic, or quasi-twisted structure. Based on…

Information Theory · Computer Science 2009-01-09 Eric Z. Chen

In this article, we construct linear codes over the commutative non-unital ring $I$ of size four. We obtain their Lee-weight distributions and study their binary Gray images. Under certain mild conditions, these classes of binary codes are…

Information Theory · Computer Science 2023-09-20 Vidya Sagar , Ritumoni Sarma

It is well known that quantum codes can be constructed by means of classical symplectic dual-containing codes. This paper considers a family of two-generator quasi-cyclic codes and derives sufficient conditions for these codes to be…

Information Theory · Computer Science 2023-01-09 Chaofeng Guan , Ruihu Li , Liangdong Lu , Yu Yao

This paper defines cyclic and minimal derivative descendants (DDs) of an extended cyclic code from the derivative of the Mattson-Solomon polynomials, respectively. First, it demonstrates that the cyclic DDs are the same extended cyclic…

Information Theory · Computer Science 2022-12-12 Bin Zhang , Qin Huang

Recently, much progress has been made to construct minimal linear codes due to their preference in secret sharing schemes and secure two-party computation. In this paper, we put forward a new method to construct minimal linear codes by…

Information Theory · Computer Science 2022-08-09 Yanjun Li , Jie Peng , Haibin Kan , Lijing Zheng
‹ Prev 1 4 5 6 7 8 10 Next ›