Qin Yue
Nanjing University of Aeronautics and Astronautics
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Qin Yue.
Finite Fields and Their Applications | 2010
Xiangyong Zeng; Lei Hu; Wenfeng Jiang; Qin Yue; Xiwang Cao
For an odd prime p and two positive integers n>=3 and k with ngcd(n,k) being odd, the paper determines the weight distribution of a class of p-ary cyclic codes C over Fp with nonzeros @a^-^1, @a^-^(^p^^^k^+^1^) and @a^-^(^p^^^3^^^k^+^1^), where @a is a primitive element of Fp^n.
IEEE Transactions on Information Theory | 2014
Chengju Li; Qin Yue; Fengwei Li
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. In this paper, let Fr be a finite field with r = q<sup>m</sup>. Suppose that g1, g2 ∈ F*<sub>r</sub> are not conjugates over F<sub>q</sub>, ord(g1) = n1, ord(g2) = n2, d = gcd(n1, n2), and n = n1n2/d. Let Fq(g1) = F<sub>q</sub>m<sub>1</sub> , Fq(g2) = Fqm<sub>2</sub> , and Ti denote the trace function from Fq<sup>m</sup><sub>i</sub> to Fq for i = 1, 2. We define a cyclic code C(q,m,n1,n2) = {c(a, b) : a ∈ F<sub>q</sub>m<sub>1</sub> , b ∈ F<sub>q</sub>m<sub>2</sub> }, where c(a, b) = (T<sub>1</sub>(ag<sup>0</sup><sub>1</sub>) + T<sub>2</sub>(bg<sup>0</sup><sub>2</sub>), T<sub>1</sub>(ag<sup>1</sup><sub>1</sub>) + T<sub>2</sub>(bg<sup>1</sup><sub>2</sub>), ... , T<sub>1</sub>(ag<sup>n-1</sup><sub>1</sub> ) + T<sub>2</sub>(bg<sup>n-1</sup><sub>2</sub> )). We mainly use Gauss periods to present the weight distribution of the cyclic code C(q,m,n1,n2). As applications, we determine the weight distribution of cyclic code C(q,m,qm<sub>1-1</sub>,qm<sub>2-1</sub>) with gcd(m1, m2) = 1; in particular, it is a three-weight cyclic code if gcd(q -1, m1 -m2) = 1. We also explicitly determine the weight distributions of some classes of cyclic codes including several classes of four-weight cyclic codes.
Finite Fields and Their Applications | 2014
Chengju Li; Qin Yue; Fengwei Li
Let F r be an extension of a finite field F q with r = q m . Let each g i be of order n i in F r * and gcd ? ( n i , n j ) = 1 for 1 ≤ i ? j ≤ u . We define a cyclic code over F q by C ( q , m , n 1 , n 2 , ? , n u ) = { C ( a 1 , a 2 , ? , a u ) : a 1 , a 2 , ? , a u ? F r } , where C ( a 1 , a 2 , ? , a u ) = ( Tr r / q ( ? i = 1 u a i g i 0 ) , ? , Tr r / q ( ? i = 1 u a i g i n - 1 ) ) and n = n 1 n 2 ? n u . In this paper, we present a method to compute the weights of C ( q , m , n 1 , n 2 , ? , n u ) . Further, we determine the weight distributions of the cyclic codes C ( q , m , n 1 , n 2 ) and C ( q , m , n 1 , n 2 , 1 ) .
Designs, Codes and Cryptography | 2016
Chengju Li; Qin Yue; Fang-Wei Fu
Let
Finite Fields and Their Applications | 2014
Fengwei Li; Qin Yue; Chengju Li
Discrete Mathematics | 2015
Sunghan Bae; Chengju Li; Qin Yue
{mathbb {F}}_r
Finite Fields and Their Applications | 2015
Chengju Li; Qin Yue
IEEE Transactions on Information Theory | 2016
Ziling Heng; Qin Yue
Fr be a finite field with
Designs, Codes and Cryptography | 2013
Liqin Hu; Qin Yue
Applicable Algebra in Engineering, Communication and Computing | 2017
Chengju Li; Qin Yue; Fangwei Fu
r=q^m