Locally Repairable Codes

Wed, May 25, 2016, 3:30 pm to 4:30 pm
E-Quad, B205

Abstract: Due to applications in large-scale distributed storage systems, local repair properties of codes have recently earned a lot of attention. In the first part of the talk, we show that generalized locality properties of codes lead to the notion of a graph capacity that is fundamental in the study of network flow problems. This amazingly reveal a new connection between locally repairable codes (LRC) and broadcasting with side information (index coding). 
We further elaborate on the central challenge in this area: deriving fundamental limits on locally repairable codes over small alphabet, and construction of maximally recoverable codes. We present our very recent result on optimum rate of LRC that outperform all previous results.