Content deleted Content added
mNo edit summary |
mNo edit summary |
||
Line 66:
Let <math>C</math> be an <math>[n, k, d]_{q}</math>-locally recoverable code. Then an erased component can be recovered linearly,<ref>{{Citation
|first1=Dimitris S.|last1=Papailiopoulos |first2=Alexandros G. |last2=Dimakis |contribution=Locally repairable codes |pages=2771–2775 |___location=Cambridge, MA, USA |
==Optimal locally recoverable codes==
|