9 citations · 65 across the 36 of their papers we have counts for
28 papers · 1 filter
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…
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…
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…
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),…
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…
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…
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.…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
Construction of Cyclic and Constacyclic Codes for b-symbol Read Channels Meeting the Plotkin-like Bound
Minghui Yang, Jin Li, Keqin Feng
The symbol-pair codes over finite fields have been raised for symbol-pair read channels and motivated by application of high-density data storage technologies [1, 2]. Their general…
Linear Codes over Galois Ring Related to Gauss sums
Aixian Zhang, Jin Li, Keqin Feng
Linear codes over finite rings become one of hot topics in coding theory after Hommons et al.([4], 1994) discovered that several remarkable nonlinear binary codes with some linear-…
Linear codes with a few weights from inhomogeneous quadratic functions
Chunming Tang, Can Xiang, Keqin Feng
Linear codes with few weights have been an interesting subject of study for many years, as these codes have applications in secrete sharing, authentication codes, association schem…
A Class of Linear Codes with a Few Weights
Can Xiang, Chunming Tang, Keqin Feng
Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association sche…
Multipartite entangled states, symmetric matrices and error-correcting codes
Keqin Feng, Lingfei Jin, Chaoping Xing +1
A pure quantum state is called -uniform if all its reductions to -qudit are maximally mixed. We investigate the general constructions of -uniform pure quantum states of $n…
A Construction of Linear Codes over $\f_{2^t}$ from Boolean Functions
Can Xiang, Keqin Feng, Chunming Tang
In this paper, we present a construction of linear codes over $\f_{2^t}$ from Boolean functions, which is a generalization of Ding's method \cite[Theorem 9]{Ding15}. Based on this…
Nonexistence of Generalized Bent Functions From to
Haiying Liu, Keqin Feng, Rongquan Feng
Several nonexistence results on generalized bent functions presented by using some knowledge on cyclotomic number fields and their imaginary quadrat…