3 citations · 9 across the 23 of their papers we have counts for
24 papers
Six Families of Binary Codes Arising from Ding's Conjectures
Xiaoqiang Wang, Shiyan Xiong, Mu yuan +3
Ding \cite{Ding2016} proposed ten conjectures on binary linear codes arising from Boolean functions. Four of them, namely Conjectures 38--41, were subsequently proved by Göloğlu an…
Solutions to Three Conjectures and an Open Problem on Binary BCH Codes
Xiaoqiang Wang, Jiawei He, Boru Yi +1
BCH codes are among the most important classes of cyclic codes and have played a central role in coding theory and its applications. One of the fundamental problems in the study of…
Improvement of the square-root low bounds on the minimum distances of BCH codes and Matrix-product codes
Xiaoqiang Wang, Liuyi Li, Yansheng Wu +2
The task of constructing infinite families of self-dual codes with unbounded lengths and minimum distances exhibiting square-root lower bounds is extremely challenging, especially…
Several new infinite families of NMDS codes with arbitrary dimensions supporting -designs
Yaozong Zhang, Dabin Zheng, Xiaoqiang Wang +1
Near maximum distance separable (NMDS) codes, where both the code and its dual are almost maximum distance separable, play pivotal roles in combinatorial design theory and cryptogr…
The weight hierarchies of three classes of linear codes
Wei Lu, Qingyao Wang, Xiaoqiang Wang +1
Studying the generalized Hamming weights of linear codes is a significant research area within coding theory, as it provides valuable structural information about the codes and pla…
The duals of narrow-sense BCH codes with length
Xiaoqiang Wang, Chengliang Xiao, Dabin Zheng
BCH codes are an interesting class of cyclic codes due to their efficient encoding and decoding algorithms. In the past sixty years, a lot of progress on the study of BCH codes has…
A new class of self-orthogonal linear codes and their applications
Yaozong Zhang, Dabin Zheng, Xiaoqiang Wang
Self-orthogonal codes are a subclass of linear codes that are contained within their dual codes. Since self-orthogonal codes are widely used in quantum codes, lattice theory and li…
The Weight Hierarchies of Linear Codes from Simplicial Complexes
Chao Liu, Dabin Zheng, Wei Lu +1
The study of the generalized Hamming weight of linear codes is a significant research topic in coding theory as it conveys the structural information of the codes and determines th…
Two classes of reducible cyclic codes with large minimum symbol-pair distances
Xiaoqiang Wang, Yue Su, Dabin Zheng +1
The high-density data storage technology aims to design high-capacity storage at a relatively low cost. In order to achieve this goal, symbol-pair codes were proposed by Cassuto an…
Generalized Hamming Weights of Linear Codes from Quadratic Forms over Finite Fields of Even Characteristic
Chao Liu, Dabin Zheng, Xiaoqiang Wang
The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine it…
Strict Half-Singleton Bound, Strict Direct Upper Bound for Linear Insertion-Deletion Codes and Optimal Codes
Qinqin Ji, Dabin Zheng, Hao Chen +1
Insertion-deletion codes (insdel codes for short) are used for correcting synchronization errors in communications, and in other many interesting fields such as DNA storage, date a…
Rack-Aware MSR Codes with Multiple Erasure Tolerance
Jiaojiao Wang, Dabin Zheng, Shenghua Li
The minimum storage rack-aware regenerating (MSRR) code is a variation of regenerating codes that achieves the optimal repair bandwidth for a single node failure in the rack-aware…
Two-to-one mappings and involutions without fixed points over $\bF_{2^n}$
Mu Yuan, Dabin Zheng, Yanping Wang
In this paper, two-to-one mappings and involutions without any fixed point on finite fields of even characteristic are investigated. First, we characterize a closed relationship be…
Several classes of PcN power functions over finite fields
Xiaoqiang Wang, Dabin Zheng
Recently, a new concept called multiplicative differential cryptanalysis and the corresponding -differential uniformity were introduced by Ellingsen et al.~\cite{Ellingsen2020},…
Some punctured codes of several families of binary linear codes
Xiaoqiang Wang, Dabin Zheng, Cunsheng Ding
Two general constructions of linear codes with functions over finite fields have been extensively studied in the literature. The first one is given by $\mathcal{C}(f)=\left\{ {\rm…
Subfield codes of linear codes from perfect nonlinear functions and their duals
Dabin Zheng, Xiaoqiang Wang, Yayao Li +1
Let be a finite field with elements, where is an odd prime and is a positive integer. Recently, \cite{Hengar} and \cite{Wang2020} determined the we…
New Constructions of Optimal Cyclic (r,δ) Locally Repairable Codes from Their Zeros
Jing Qiu, Dabin Zheng, Fang-Wei Fu
An -locally repairable code (-LRC for short) was introduced by Prakash et al. \cite{Prakash2012} for tolerating multiple failed nodes in distributed storage systems…
Binary linear codes with few weights from Boolean functions
Xiaoqiang Wang, Dabin Zheng, Yan Zhang
Boolean functions have very nice applications in cryptography and coding theory, which have led to a lot of research focusing on their applications. The objective of this paper is…
A class of two or three weights linear codes and their complete weight enumerators
Dabin Zheng, Qing Zhao, Xiaoqiang Wang +1
In the past few years, linear codes with few weights and their weight analysis have been widely studied. In this paper, we further investigate a class of two-weight or three-weight…
Two classes of -ary linear codes and their duals
Xiaoqiang Wang, Dabin Zheng, Yan Zhang
Let be the finite field of order , where is an odd prime and is a positive integer. In this paper, we investigate a class of subfield codes of linea…
Constructions of involutions over finite fields
Dabin Zheng, Mu Yuan, Nian Li +2
An involution over finite fields is a permutation polynomial whose inverse is itself. Owing to this property, involutions over finite fields have been widely used in applications s…
Two types of permutation polynomials with special forms
Dabin Zheng, Mu Yuan, Long Yu
Let be a power of a prime and be a finite field with elements. In this paper, we propose four families of infinite classes of permutation trinomials having t…
On More Bent Functions From Dillon Exponents
L. Yu, H. Liu, D. Zheng
In this paper, we obtain a new class of -ary binomial bent functions which are determined by Kloosterman sums. The bentness of another three classes of functions is characterize…
A Recursive Method for Determining the One-Dimensional Submodules of Laurent-Ore Modules
Ziming Li, Michael F. Singer, Min Wu +1
We present a method for determining the one-dimensional submodules of a Laurent-Ore module. The method is based on a correspondence between hyperexponential solutions of associated…