6 papers
Near MDS codes from oval polynomials
Qiuyan Wang, Ziling Heng
A linear code with parameters of the form is referred to as an MDS (maximum distance separable) code. A linear code with parameters of the form is sai…
Asymptotically optimal codebooks derived from generalised bent functions
Qiuyan Wang, Yang Yan, Chenhuang Wu +1
Codebooks are required to have small inner-product correlation in many practical applications, such as direct spread code division multiple access communications, space-time codes…
A kind of quaternary sequences of period and their linear complexity
Qiuyan Wang, Chenhuang Wu, Minghui Yang +1
Sequences with high linear complexity have wide applications in cryptography. In this paper, a new class of quaternary sequences over with period is constr…
Multisequences with high joint nonlinear complexity from function fields
Yang Yan, Qiuyan Wang, Chenhuang Wu
Multisequences over finite fields play a pushing role in the applications that relate to parallelization, such as word-based stream ciphers and pseudorandom vector generation. It i…
The 2-adic complexity of Yu-Gong sequences with interleaved structure and optimal autocorrelation magnitude
Yuhua Sun, Tongjiang Yan, Qiuyan Wang
In 2008, a class of binary sequences of period with optimal autocorrelation magnitude has been presented by Yu and Gong based on an -sequence, the perfect se…
On the -error linear complexity of binary sequences derived from the discrete logarithm in finite fields
Zhixiong Chen, Qiuyan Wang
Let be a power of an odd prime . We study binary sequences with entries in defined by using the quadratic character of the finite fiel…