4 citations · 4 across the 4 of their papers we have counts for
5 papers
The Cheng-Murray Conjecture on Deep Holes of Full-Length Reed-Solomon Codes
Weijun Fang
Let denote the full-length Reed--Solomon code over . Every word has a unique interpolation polynomial $U(X)…
Tight Bandwidth Lower Bounds and Optimal Constructions of Locally Repairable Convertible Codes in the Global Split Regime
Haoming Shi, Weijun Fang
Erasure coding is a key technique for providing fault tolerance in modern distributed storage systems. In practice, as storage systems evolve, the parameters of the deployed erasur…
Private Information Retrieval from Joint Systematic MDS-Coded with Non-Colluding Servers: Bounds and Constructions
Jingke Xu, Lirong Shi, Peng Lan +1
Consider a distributed storage system consisting of non-colluding servers that collectively store a database of files encoded using an maximum distance separable(MD…
Deep Holes of Twisted Reed-Solomon Codes
Weijun Fang, Jingke Xu, Ruiqi Zhu
The deep holes of a linear code are the vectors that achieve the maximum error distance (covering radius) to the code. {Determining the covering radius and deep holes of linear cod…
Optimal Locally Repairable Codes via Punctured Simplex Codes
Yuan Gao, Weijun Fang, Jingke Xu +2
Locally repairable codes (LRCs) have attracted a lot of attention due to their applications in distributed storage systems. In this paper, we provide new constructions of optimal $…