activity
20112023
most citedMultivariate Interpolation Formula over Finite Fields and Its Applications in Coding Theory

9 citations · 65 across the 36 of their papers we have counts for

collaborators

36 papers

cs.IT2023

The Weight Distributions of Two Classes of Linear Codes From Perfect Nonlinear Functions

Huawei Wu, Jing Yang, Keqin Feng

In this paper, we employ general results on the value distributions of perfect nonlinear functions from to together with a specific group action t…

quant-ph2023

Constructions of -uniform states in heterogeneous systems

Keqin Feng, Lingfei Jin, Chaoping Xing +1

A pure quantum state of parties associated with the Hilbert space $\CC^{d_1}\otimes \CC^{d_2}\otimes\cdots\otimes \CC^{d_n}$ is called -uniform if all the reductions to -…

cs.IT2022

Arithmetic autocorrelation distribution of binary -sequences

Xiaoyan Jing, Aixian Zhang, Keqin Feng

Binary -sequences are ones with the largest period among the binary sequences produced by linear shift registers with length . They have a wide range of application…

cs.IT2022★ 1 cited

The 4-Adic Complexity of Interleaved Quaternary Sequences of Even Length with Optimal Autocorrelation

Xiaoyan Jing, Zhefeng Xu, Minghui Yang +1

Su et al. proposed several new classes of quaternary sequences of even length with optimal autocorrelation interleaved by twin-prime sequences pairs, GMW sequences pairs or binary…

cs.IT2021

Optimal Combinatorial Neural Codes with Matched Metric : Characterization and Constructions

Aixian Zhang, Xiaoyan Jin, Keqin Feng

Based on the theoretical neuroscience, G. Cotardo and A. Ravagnavi in \cite{CR} introduced a kind of asymmetric binary codes called combinatorial neural codes (CN codes for short),…

quant-ph2021★ 1 cited

Constructions on Real Approximate Mutually Unbiased Bases

Minghui Yang, Aixian Zhang, Jiejing Wen +1

Mutually unbiased bases (MUB) have many applications in quantum information processing and quantum cryptography. Several complex MUB's in for some dimension and…

cs.IT2021★ 2 cited

On the 4-Adic Complexity of Quaternary Sequences with Ideal Autocorrelation

Minghui Yang, Shiyuan Qiang, Xiaoyan Jing +2

In this paper, we determine the 4-adic complexity of the balanced quaternary sequences of period and with ideal autocorrelation defined by Kim et al. (ISIT, pp. 282…

cs.IT2021★ 1 cited

Linear Complexity of Binary Interleaved Sequences of Period 4n

Qiuyue Liu, Shiyuan Qiang, Minghui Yang +1

Binary periodic sequences with good autocorrelation property have many applications in many aspects of communication. In past decades many series of such binary sequences have been…

cs.IT2021★ 1 cited

Determination of the Autocorrelation Distribution and 2-Adic Complexity of Generalized Cyclotomic Binary Sequences of Order 2 with Period pq

Xiaoyan Jing, Shiyuan Qiang, Minghui Yang +1

The generalized cyclotomic binary sequences with period have good autocorrelation property where and are distinct odd primes.…

cs.IT2021★ 5 cited

4-Adic Complexity of Interleaved Quaternary Sequences

Shiyuan Qiang, Xiaoyan Jing, Minghui Yang +1

Tang and Ding \cite{X. Tang} present a series of quaternary sequences interleaved by two binary sequences and with ideal autocorrelation and show that such interl…

cs.IT2020★ 5 cited

The 4-Adic Complexity of A Class of Quaternary Cyclotomic Sequences with Period 2p

Shiyuan Qiang, Yan Li, Minghui Yang +1

In cryptography, we hope a sequence over with period having larger -adic complexity. Compared with the binary case, the computation of 4-adic complexity of kn…

math.NT2020

-Congruent Numbers, Tiling Numbers and the Selmer Rank of Related Elliptic Curves: odd n

Qiuyue Liu, Jing Yang, Keqin Feng

Several discrete geometry problems are closely related to the arithmetic theory of elliptic curves defined on the rational fields . In this paper we consider the -co…

cs.IT2020★ 7 cited

Determination of 2-Adic Complexity of Generalized Binary Sequences of Order 2

Minghui Yang, Keqin Feng

The generalized binary sequences of order 2 have been used to construct good binary cyclic codes [4]. The linear complexity of these sequences has been computed in [2]. The autocor…

cs.IT2019★ 4 cited

On the Constructions of MDS Self-dual Codes via Cyclotomy

Aixian Zhang, Keqin Feng

MDS self-dual codes over finite fields have attracted a lot of attention in recent years by their theoretical interests in coding theory and applications in cryptography and combin…

cs.IT2019★ 5 cited

An Unified Approach on Constructing of MDS Self-dual Codes via Reed-Solomon Codes

Aixian Zhang, Keqin Feng

Based on the fundamental results on MDS self-dual codes over finite fields constructed via generalized Reed-Solomon codes \cite{JX} and extended generalized Reed-Solomon codes \cit…

cs.IT2019★ 1 cited

On the 2-adic complexity of a class of binary sequences of period with optimal autocorrelation magnitude

Minghui Yang, Lulu Zhang, Keqin Feng

Via interleaving Ding-Helleseth-Lam sequences, a class of binary sequences of period with optimal autocorrelation magnitude was constructed in \cite{W. Su}. Later, Fan showed…

cs.IT2019★ 1 cited

On the 2-Adic Complexity of the Ding-Helleseth-Martinsen Binary Sequences

Lulu Zhang, Jun Zhang, Minghui Yang +1

We determine the 2-adic complexity of the Ding-Helleseth-Martinsen (DHM) binary sequences by using cyclotomic numbers of order four, "Gauss periods" and "quadratic Gauss sum" on fi…

math.NT2018

A new criterion on k-normal elements over finite fields

Aixian Zhang, Keqin Feng

The notion of normal elements for finite fields extension has been generalized as k-normal elements by Huczynska et al. [3]. The number of k-normal elements for a fixed finite fiel…

math.CO2018★ 2 cited

Non-existence of perfect binary sequences

X. Niu, H. Cao, K. Feng

Binary sequences with lower autocorrelation values have important applications in cryptography and communications. In this paper, we present all possible parameters for binary peri…

quant-ph2017

Perfect State Transfer on Abelian Cayley Graphs

Yingying Tan, Keqin Feng, Xiwang Cao

Perfect state transfer (PST) has great significance due to its applications in quantum information processing and quantum computation. In this paper we present a characterization o…

cs.IT2017★ 2 cited

Cyclotomic Construction of Strong External Difference Families in Finite Fields

Jiejing Wen, Minghui Yang, Fangwei Fu +1

Strong external difference family (SEDF) and its generalizations GSEDF, BGSEDF in a finite abelian group are combinatorial designs raised by Paterson and Stinson [7] in 2016 an…

cs.IT2016

The -Strong External Difference Family with Exists

Jiejing Wen, Minghui Yang, Keqin Feng

The notion of strong external difference family (SEDF) in a finite abelian group is raised by M. B. Paterson and D. R. Stinson [5] in 2016 and motivated by its application…

cs.IT2016

Linear Codes over and Reaching the Griesmer Bound

Jin Li, Aixian Zhang, Keqin Feng

We construct two series of linear codes over finite ring and Galois ring respectively reaching the Griesmer bound. They derive two series of c…

quant-ph2016

Mutually unbiased maximally entangled bases in

Junying Liu, Minghui Yang, Keqin Feng

We study mutually unbiased maximally entangled bases (MUMEB's) in bipartite system . We generalize the method to construct MUMEB's given…