【Author】
Jin, Lingfei; Kan, Haibin; Zhang, Yu
【Source】IEEE TRANSACTIONS ON INFORMATION THEORY
【Abstract】Locally repairable codes with more than one recovering set are demanded in the application to distributed storage. For each failure node (or disk), it is desired to have as many recovering sets as possible. In this paper, we make use of automorphisms of rational function fields to construct locally repairable codes with multiple recovering sets. Although we focus on two recovering sets, our construction can be easily generalized to the case of multiple recovering sets. In particular, we obtain a class of locally repairable codes with minimum distance only 1 less than the upper bound.
【Keywords】Upper bound; Maintenance engineering; Cost accounting; Indexes; Distributed databases; Blockchain; Education; Locally repairable codes; rational function field; automorphism group
评论