English
Related papers

Related papers: On the Weight Distribution of Cyclic Codes with Ni…

200 papers

Let $\mathbb{F}_q$ be a finite field of order $q$ and integer $n\ge 1$. Let $\ell$ be a prime such that $\ell^k|(q-1)$ for some integer $k\ge 1$ and $\mu$ be an element of order $\ell^k$ in $\mathbb{F}_q$. In this paper, we determine the…

Combinatorics · Mathematics 2018-06-29 Manjit Singh

In this letter, we introduce an efficient method for estimating weight distributions of polar codes and polarization-adjusted convolutional (PAC) codes. Based on a recursive algorithm of computing the weight enumerating functions of polar…

Information Theory · Computer Science 2023-10-13 Junhua You , Shaohua Wu , Yajing Deng , Qinyu Zhang

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-05-03 Tingfang Chen , Cunsheng Ding , Chengju Li , Zhonghua Sun

Let C be an arbitrary simple-root cyclic code and let G be the subgroup of Aut(C) (the automorphism group of C) generated by the multiplier, the cyclic shift and the scalar multiplications. To the best of our knowledge, the subgroup G is…

Information Theory · Computer Science 2023-05-25 Bocong Chen , Yuqing Fu , Hongwei Liu

We construct a family of two-Lee-weight codes over the ring $R_k,$ which is defined as trace codes with algebraic structure of abelian codes. The Lee weight distribution of the two-weight codes is given. Taking the Gray map, we obtain…

Information Theory · Computer Science 2016-12-19 Minjia Shi , Yue Guan

Cyclic codes are a subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics due to their efficient encoding and decoding algorithms. Let $p\ge 5$ be an odd prime and $m$ be…

Information Theory · Computer Science 2022-08-31 Gaofei Wu , Huan Liu , Yuqing Zhang

In the last 60 years coding theory has been studied a lot over finite fields $\mathbb{F}_q$ or commutative rings $\mathcal{R}$ with unity. Although in $1993$, a study on the classification of the rings (not necessarily commutative or ring…

Information Theory · Computer Science 2022-08-19 Sourav Deb , Isha Kikani , Manish K Gupta

Cyclic codes are among the most important families of codes in coding theory for both theoretical and practical reasons. Despite their prominence and intensive research on cyclic codes for over a half century, there are still open problems…

Information Theory · Computer Science 2021-07-02 Nuh Aydin , R. Oliver VandenBerg

In this paper, several classes of three-weight codes and two-weight codes for the homogeneous metric over the chain ring $R=\mathbb{F}_p+u\mathbb{F}_p+\cdots +u^{k-1}\mathbb{F}_{p},$ with $u^k=0,$ are constructed, which generalises…

Information Theory · Computer Science 2017-03-21 Minjia Shi , Rongsheng Wu , Liqin Qian , Lin Sok , Patrick Solé

In this paper, several classes of three-weight codes and two-weight codes for the homogeneous metric over the chain ring $R=\mathbb{F}_p+u\mathbb{F}_p+\cdots +u^{k-1}\mathbb{F}_{p},$ with $u^k=0,$ are constructed, which generalises…

Information Theory · Computer Science 2017-01-10 Minjia Shi , Rongsheng Wu , Liqin Qian , Lin Sok , Patrick Sole

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime $p$, we determine the explicit complete weight enumerators of two classes of linear codes over $\mathbb{F}_p$ and they…

Information Theory · Computer Science 2015-07-21 Shudi Yang , Zheng-An Yao

Negacyclic BCH codes are an important subclass of negacyclic codes and are the best linear codes in most cases, but their parameters are hard to determine. In this paper, we mainly study two types of negacyclic BCH codes of length…

Information Theory · Computer Science 2023-09-06 Yanhui Zhang , Li Liu , Xianhong Xie

We study the functional codes $C_2(X)$ defined on a projective variety $X$, in the case where $X \subset {\mathbb{P}}^3$ is a non-degenerate hermitian surface. We first give some bounds for $# X_{Z(\mathcal{Q})}(\mathbb{F}_{q})$, which are…

Algebraic Geometry · Mathematics 2007-05-23 Frederic A. B. Edoukou

We consider the weight spectrum of a class of quasi-perfect binary linear codes with code distance 4. For example, extended Hamming code and Panchenko code are the known members of this class. Also, it is known that in many cases Panchenko…

Information Theory · Computer Science 2017-06-13 Valentine B. Afanassiev , Alexander A. Davydov

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime $p$, we present the explicit complete weight enumerator of a family of $p$-ary linear codes constructed with defining…

Information Theory · Computer Science 2017-07-07 Shudi Yang , Zheng-An Yao

We construct an infinite family of two-Lee-weight and three-Lee-weight codes over the non-chain ring $\mathbb{F}_p+u\mathbb{F}_p+v\mathbb{F}_p+uv\mathbb{F}_p,$ where $u^2=0,v^2=0,uv=vu.$ These codes are defined as trace codes. They have the…

Information Theory · Computer Science 2016-12-02 Yan Liu , Minjia Shi , Patrick Solé

Recently, linear codes with few weights have been widely studied, since they have applications in data storage systems, communication systems and consumer electronics. In this paper, we present a class of three-weight and five-weight linear…

Information Theory · Computer Science 2015-09-22 Fei Li , Qiuyan Wang , Dongdai Lin

Recently, simplicial complexes are used in constructions of several infinite families of minimal and optimal linear codes by Hyun {\em et al.} Building upon their research, in this paper more linear codes over the ring $\mathbb{Z}_4$ are…

Information Theory · Computer Science 2024-01-24 Yansheng Wu , Chao Li , Lin Zhang , Fu Xiao

BCH codes are an important class of cyclic codes, and have wide applicantions in communication and storage systems. However, it is difficult to determine the parameters of BCH codes and only a few cases are known. In this paper, we mainly…

Information Theory · Computer Science 2022-12-07 Yanhui Zhang

We construct trace codes over $\Z_4$ by using Boolean functions and skew sets, respectively. Their Lee weight distribution is studied by using a Galois ring version of the Walsh-Hadamard transform and exponential sums. We obtain a new…

Information Theory · Computer Science 2017-07-04 Minjia Shi , Yan Liu , Randriam Hugues , Lin Sok , Patrick Sole
‹ Prev 1 8 9 10 Next ›