How long can optimal locally repairable codes be?

• Main Authors: Guruswami, Venkatesan, Xing, Chaoping, Yuan, Chen
• Other Authors: School of Physical and Mathematical Sciences
• Format: Article
• Language: English
• Published: 2018
• Subjects: DRNTU::Science::Mathematics; Locally Repairable Code; Singleton Bound
• Online Access: https://hdl.handle.net/10356/89385; http://hdl.handle.net/10220/46213
• Institution: Nanyang Technological University

A locally repairable code (LRC) with locality r allows for the recovery of any erased codeword symbol using only r other codeword symbols. A Singleton-type bound dictates the best possible trade-off between the dimension and distance of LRCs - an LRC attaining this trade-off is deemed optimal. Such...