94 citations · 111 across the 17 of their papers we have counts for
19 papers
Duality and Reverse Self-Dual Constructions for Hyperderivative Reed-Solomon Codes
Hongchang Li, Zhihao Zhu, Weijun Fang +2
Hyperderivative Reed-Solomon (HRS) codes form a class of maximum-distance-separable codes under the Niederreiter-Rosenbloom-Tsfasman metric and may be viewed as a derivative-evalua…
Reed-Solomon Codes with Optimal Repair Bandwidth: A Basis-Transformation Approach
Jing Qiu, Weijun Fang, Shu-Tao Xia +1
Maximum distance separable (MDS) codes are widely used in distributed storage, but naively repairing a single failure in an MDS code requires downloading the full contents…
Some New Results on Sequence Reconstruction Problem for Deletion Channels
Xiang Wang, Weijun Fang, Han Li +1
Levenshtein first introduced the sequence reconstruction problem in . In the realm of combinatorics, the sequence reconstruction problem is equivalent to determining the valu…
Three Classes of Twisted Gabidulin Codes with Different Twists
Ran Li, Fang-Wei Fu, Weijun Fang
Twisted Gabidulin codes are an extension of Gabidulin codes and have recently attracted great attention. In this paper, we study three classes of twisted Gabidulin codes with diffe…
Construction of MDS Euclidean Self-Dual Codes via Multiple Subsets
Weirong Meng, Weijun Fang, Fang-Wei Fu +2
MDS self-dual codes have good algebraic structure, and their parameters are completely determined by the code length. In recent years, the construction of MDS Euclidean self-dual c…
New Lower Bounds for the Minimum Distance of Cyclic Codes and Applications to Locally Repairable Codes
Jing Qiu, Weijun Fang, Fang-Wei Fu
Cyclic codes are an important class of linear codes. Bounding the minimum distance of cyclic codes is a long-standing research topic in coding theory, and several well-known and ba…
Singleton-Optimal LRCs and Perfect LRCs via Cyclic and Constacyclic Codes
Weijun Fang, Fang-Wei Fu, Bin Chen +1
Locally repairable codes (LRCs) have emerged as an important coding scheme in distributed storage systems (DSSs) with relatively low repair cost by accessing fewer non-failure node…
Bounds and Constructions of Singleton-Optimal Locally Repairable Codes with Small Localities
Weijun Fang, Bin Chen, Shu-Tao Xia +1
Constructions of optimal locally repairable codes (LRCs) achieving Singleton-type bound have been exhaustively investigated in recent years. In this paper, we consider new bounds a…
Some Results on the Improved Bound and Construction of Optimal LRCs
Bin Chen, Weijun Fang, Yueqi Chen +3
Locally repairable codes (LRCs) with locality were introduced by Prakash \emph{et al.} into distributed storage systems (DSSs) due to their benefit of locally repairing at…
On pure MDS asymmetric entanglement-assisted quantum error-correcting codes
Ziteng Huang, Weijun Fang, Fang-Wei Fu
Recently, Galindo et al. introduced the concept of asymmetric entanglement-assisted quantum error-correcting codes (AEAQECCs) from Calderbank-Shor-Steane (CSS) construction. In gen…
New constructions of MDS self-dual and self-orthogonal codes via GRS codes
Ziteng Huang, Weijun Fang, Fang-Wei Fu
Recently, the construction of new MDS Euclidean self-dual codes has been widely investigated. In this paper, for square q, we utilize generalized Reed-Solomon (GRS) codes and their…
Construction of MDS Euclidean Self-Dual Codes via Two Subsets
Weijun Fang, Shu-Tao Xia, Fang-Wei Fu
The parameters of a -ary MDS Euclidean self-dual codes are completely determined by its length and the construction of MDS Euclidean self-dual codes with new length has been wid…
A Note on Self-Dual Generalized Reed-Solomon Codes
Weijun Fang, Jun Zhang, Shu-Tao Xia1 +1
A linear code is called an MDS self-dual code if it is both an MDS code and a self-dual code with respect to the Euclidean inner product. The parameters of such codes are completel…
An Accuracy-Lossless Perturbation Method for Defending Privacy Attacks in Federated Learning
Xue Yang, Yan Feng, Weijun Fang +4
Although federated learning improves privacy of training data by exchanging local gradients or parameters rather than raw data, the adversary still can leverage local gradients and…
Euclidean and Hermitian Hulls of MDS Codes and Their Applications to EAQECCs
Weijun Fang, Fang-Wei Fu, Lanqiang Li +1
In this paper, we construct several classes of maximum distance separable (MDS) codes via generalized Reed-Solomon (GRS) codes and extended GRS codes, where we can determine the di…
Optimal cyclic locally repairable codes with unbounded length
Weijun Fang, Fang-Wei Fu
Locally repairable codes with locality (-LRCs for short) were introduced by Gopalan et al. \cite{1} to recover a failed node of the code from at most other available nod…
Some New Constructions of Quantum MDS Codes
Weijun Fang, Fang-Wei Fu
It is an important task to construct quantum maximum-distance-separable (MDS) codes with good parameters. In the present paper, we provide six new classes of q-ary quantum MDS code…
Two new classes of quantum MDS codes
Weijun Fang, Fang-Wei Fu
Let be a prime and let be a power of . In this paper, by using generalized Reed-Solomon (GRS for short) codes and extended GRS codes, we construct two new classes of qua…
On deep-holes of Gabidulin codes
Weijun Fang, Li-Ping Wang, Daqing Wan
In this paper, we determine the covering radius and a class of deep holes for Gabidulin codes with both rank metric and Hamming metric. Moreover, we give a necessary and sufficient…