Codes with unequal locality

Swanand Kadhe, Alex Sprintson · 2016

In many practical settings, there is a need to design distributed storage codes with certain locality constraints. For a code C, its i-th symbol is said to have locality r if it can be recovered by accessing some other r symbols of C. Locally repairable codes (LRCs) are the family of codes such that every symbol has small locality.

Read the paper · More papers on PaperTik