2019/08/05 by Liming Ma, Chaoping Xing, Ma, Liming +1 · 1 citation
Computer Science · #Advanced Data Storage Technologies #Cloud Data Security Solutions #Cryptography and Data Security #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1908.01471
openalex publication_date 2019/08/05 · openalex created_date 2019/08/13 · openalex updated_date 2026/07/28
Locally repairable codes have been investigated extensively in recent years due to practical applications in distributed and cloud storage systems. However, there are few asymptotical constructions of locally repairable codes in the literature. In this paper, we provide an explicit asymptotic construction of locally repairable codes over arbitrary finite fields from local expansions of functions at a rational place. This construction gives a Tsfasman-Vladut-Zink type bound for locally repairable codes. Its main advantage is that there are no constraints on both locality and alphabet size. Furthermore, we show that the Gilbert-Varshamov type bound on locally repairable codes over non-prime finite fields can be exceeded for sufficiently large alphabet size.