4 papers · 1 filter
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…
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…
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…