23 citations · 148 across the 60 of their papers we have counts for
5 papers · 2 filters
Optimal locally repairable codes via elliptic curves
Xudong Li, Liming Ma, Chaoping Xing
Constructing locally repairable codes achieving Singleton-type bound (we call them optimal codes in this paper) is a challenging task and has attracted great attention in the last…
Construction of asymptotically good locally repairable codes via automorphism groups of function fields
Xudong Li, Liming Ma, Chaoping Xing
Locally repairable codes have been investigated extensively in recent years due to practical application in distributed storage as well as theoretical interest. However, not much w…
Construction of optimal locally repairable codes via automorphism groups of rational function fields
Lingfei Jin, Liming Ma, Chaoping Xing
Locally repairable codes, or locally recoverable codes (LRC for short) are designed for application in distributed and cloud storage systems. Similar to classical block codes, ther…
Efficiently repairing algebraic geometry codes
Lingfei Jin, Yuan Luo, Chaoping Xing
Minimum storage regenerating codes have minimum storage of data in each node and therefore are maximal distance separable (MDS for short) codes. Thus, the number of nodes is upper…
Algebraic geometry codes with complementary duals exceed the asymptotic Gilbert-Varshamov bound
Lingfei Jin, Chaoping Xing
It was shown by Massey that linear complementary dual (LCD for short) codes are asymptotically good. In 2004, Sendrier proved that LCD codes meet the asymptotic Gilbert-Varshamov (…