9 papers · 1 filter
The minimum distance of the antiprimitive BCH code with designed distance 3
Haojie Xu, Xia Wu, Wei Lu +1
Let denote the antiprimitive BCH code with designed distance 3. In this paper, we demonstrate that the minimum distance of $\mathcal{C}_{(q,q^m+1,…
The dual codes of two families of BCH codes
Haojie Xu, Xia Wu, Wei Lu +1
In this paper, we present an infinite family of MDS codes over and two infinite families of almost MDS codes over for any prime , by invest…
Infinite families of MDS and almost MDS codes from BCH codes
Haojie Xu, Xia Wu, Wei Lu +1
In this paper, the sufficient and necessary condition for the minimum distance of the BCH codes over with length and designed distance 3 to be 3 and 4 are prov…
Minimal Linear Codes Constructed from partial spreads
W. Lu, X. Wu, X. W. Cao +2
Partial spread is important in finite geometry and can be used to construct linear codes. From the results in (Designs, Codes and Cryptography 90:1-15, 2022) by Xia Li, Qin Yue and…
Minimal Linear Codes Constructed from hierarchical posets with two levels
X. Wu, W. Lu, X. P. Qin +1
J. Y. Hyun, et al. (Des. Codes Cryptogr., vol. 88, pp. 2475-2492, 2020) constructed some optimal and minimal binary linear codes generated by one or two order ideals in hierarchica…
A Proof of a Conjecture About a Class of Near Maximum Distance Separable Codes
Wei Lu, Xia Wu
In this paper, we completely determine the number of solutions to for all $b\in \mathbb{F}_{q^2}, c\in\mathbb{…
Regular complete permutation polynomials over quadratic extension fields
Wei Lu, Xia Wu, Yufei Wang +1
Let be any positive integer which is relatively prime to and . Let be any permutation polynomials over is an…
A general construction of regular complete permutation polynomials
Wei Lu, Xia Wu, Yufei Wang +1
Let be a positive integer and the finite field with elements. In this paper, we consider the -regular complete permutation property of maps with the…
A new method for constructing linear codes with small hulls
Liqin Qian, Xiwang Cao, Wei Lu +1
The hull of a linear code over finite fields is the intersection of the code and its dual, which was introduced by Assmus and Key. In this paper, we develop a method to construct l…