A locally recoverable code (LRC code) is a code over a finite alphabet such that every symbol in the encoding is a function of a small number of other symbols that form a recovering set. Bounds on the rate and distance of such codes have been extensively studied in the literature. In this paper we derive upper bounds on the rate and distance of codes in which every symbol has t ≥ 1 disjoint recovering sets.
Upper bounds on the rate and minimum distance of codes with all-symbol (α, δ) c -locality was proved in REF .
Bounds on locally recoverable codes with multiple recovering sets
2014 IEEE International Symposium on Information Theory
2014 IEEE International Symposium on Information Theory
Computer Science Mathematics