4 papers
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…
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 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…