Multi-symbol Locally Repairable Codes
Name
Sushanta Paudyal
Abstract
Locally Repairable Codes (LRCs) have seen an increase in interest because of their applicability in distributed storage systems. In this thesis, we define and study a generalization of LRCs that we name Multi-symbol Locally Repairable Codes (MLRCs). MLRCs can be useful in situations where multiple users request data from a number of failed servers, concurrently. We derive an upper bound on the minimum distance of such MLRCs.
Graduation Thesis language
English
Graduation Thesis type
Master - Computer Science
Supervisor(s)
Vitaly Skachek
Defence year
2015