English
Related papers

Related papers: A Class of Nonbinary Codes and Their Weight Distri…

200 papers

Let $p \geq 5$ be an odd prime. Using the correspondence between secondary Adams differentials and secondary algebraic Novikov differentials, we compute four families of nontrivial secondary differentials on the fourth line of the Adams…

Algebraic Topology · Mathematics 2023-05-18 Xiangjun Wang , Yaxing Wang , Yu Zhang

We construct a class of linear codes by choosing a proper defining set and determine their complete weight enumerators and weight enumerators. The results show that they are at most three-weight codes and they are suitable for applications…

Information Theory · Computer Science 2019-01-23 Shudi Yang , Xiangli Kong

Based on the generic construction of linear codes, we construct linear codes over the ring $\Bbb Z_4$ via posets of the disjoint union of two chains. We determine the Lee weight distributions of the quaternary codes. Moreover, we obtain…

Information Theory · Computer Science 2019-10-29 Xiaomeng Zhu , Yansheng Wu , Qin Yue

Motivated by a connection between semi-regular relative difference sets and mutually unbiased bases, we study relative difference sets with parameters $(m,n,m,m/n)$ in groups of non-prime-power orders. Let $p$ be an odd prime. We prove that…

Combinatorics · Mathematics 2008-01-23 Tao Feng , Qing Xiang

The interplay between coding theory and $t$-designs has attracted a lot of attention for both directions. It is well known that the supports of all codewords with a fixed weight in a code may hold a $t$-design. In this paper, by determining…

Combinatorics · Mathematics 2019-03-19 Xiaoni Du , Rong Wang , Chunming Tang , Qi Wang

In this paper we extend the works \cite{gegeng2,XLZD} further in two directions and compute the weight distribution of these cyclic codes under more relaxed conditions. It is interesting to note that many cyclic codes in the family are…

Information Theory · Computer Science 2015-02-17 Maosheng Xiong , Nian Li

We construct strongly walk-regular graphs as coset graphs of the duals of codes with three non-zero homogeneous weights over $\mathbb{Z}_{p^m},$ for $p$ a prime, and more generally over chain rings of depth $m$, and with a residue field of…

Combinatorics · Mathematics 2019-12-10 Michael Kiermaier , Sascha Kurz , Minjia Shi , Patrick Solé

The generalized Hamming weights (GHWs) are fundamental parameters of linear codes. GHWs are of great interest in many applications since they convey detailed information of linear codes. In this paper, we continue the work of [10] to study…

Information Theory · Computer Science 2017-02-07 Shuxing Li

Let $f(n,k)$ be the largest number of positive integers not exceeding $n$ from which one cannot select $k+1$ pairwise coprime integers, and let $E(n,k)$ be the set of positive integers which do not exceed $n$ and can be divided by at least…

Number Theory · Mathematics 2014-09-16 Yong-Gao Chen , Xiao-Feng Zhou

In this paper, a class of two-weight and three-weight linear codes over $\gf(p)$ is constructed, and their application in secret sharing is investigated. Some of the linear codes obtained are optimal in the sense that they meet certain…

Information Theory · Computer Science 2015-03-24 Kelan Ding , Cunsheng Ding

The weight distribution of second order $q$-ary Reed-Muller codes have been determined by Sloane and Berlekamp (IEEE Trans. Inform. Theory, vol. IT-16, 1970) for $q=2$ and by McEliece (JPL Space Programs Summary, vol. 3, 1969) for general…

Information Theory · Computer Science 2019-03-20 Shuxing Li

Minimal codes are a class of linear codes which gained interest in the last years, thanks to their connections to secret sharing schemes. In this paper we provide the weight distribution and the parameters of families of minimal codes…

Combinatorics · Mathematics 2020-04-30 Daniele Bartoli , Matteo Bonini , Marco Timpanella

Cyclic codes are an interesting family of linear codes since they have efficient decoding algorithms and contain optimal codes as subfamilies. Constructing infinite families of cyclic codes with good parameters is important in both theory…

Information Theory · Computer Science 2023-11-01 Zhonghua Sun , Ling Li , Shixin Zhu

In this paper, we propose a class of linear codes and obtain their weight distribution. Some of these codes are almost optimal. Moreover, several classes of constant composition codes(CCCs) are constructed as subcodes of linear codes.

Information Theory · Computer Science 2017-06-28 Long Yu , Xiusheng Liu

The cross-correlation problem is a classic problem in sequence design. In this paper we compute the cross-correlation distribution of the Niho-type decimation $d=3(p^m-1)+1$ over $\mathrm{GF}(p^{2m})$ for any prime $p \ge 5$. Previously…

Information Theory · Computer Science 2023-09-14 Maosheng Xiong , Haode Yan

Let $n$ be a positive integer. We discuss pairs of distinct odd primes $p$ and $q$ not dividing $n$ for which the Diophantine equations $pq=x^2+ny^2$ have integer solutions in $x$ and $y$. As its examples we classify all such pairs of $p$…

Number Theory · Mathematics 2014-04-18 Ja Kyung Koo , Dong Hwa Shin

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

Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we provide a slightly different approach toward the general problem and use it to solve one more special…

Number Theory · Mathematics 2011-11-15 Maosheng Xiong

Let $q=p^n$ with $p$ be an odd prime. Let $0\leq k\leq n-1$ and $k\neq n/2$. In this paper we determine the value distribution of following exponential(character) sums \[\sum\limits_{x\in \bF_q}\zeta_p^{\Tra_1^n(\alpha x^{p^{3k}+1}+\beta…

Information Theory · Computer Science 2009-02-27 Jinquan Luo , San Ling , Chaoping Xing

All binary self-dual [44,22,8] codes with an automorphism of order 3 or 7 are classified. In this way we complete the classification of extremal self-dual codes of length 44 having an automorphism of odd prime order.

Combinatorics · Mathematics 2015-03-13 Stefka Bouyuklieva , Nikolay Yankov , Radka Russeva