6 papers
The Minimum Subpacketization of Reed-Solomon Codes with Linear Repair Achieving the Cut-Set Bound
Weijun Fang, Jing Qiu, Shu-Tao Xia +1
In this paper, we study the minimum subpacketization of Reed-Solomon (RS) codes over admitting cut-set-optimal exact -linear repair of e…
Constructions of locally repairable codes via concatenated codes
Hengfeng Jin, Fang-Wei Fu
In recent years, locally repairable codes (LRCs) have attracted considerable attention owing to their pivotal role in distributed storage systems. Since binary linear locally repai…
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…
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…
Some new constructions of optimal linear codes and alphabet-optimal -locally repairable codes
Jing Qiu, Fang-Wei Fu
In distributed storage systems, locally repairable codes (LRCs) are designed to reduce disk I/O and repair costs by enabling recovery of each code symbol from a small number of oth…