Coding Theory: Load Balanced Fractional Repetition Codes

Speaker:
Shashwat Silas (Stanford University)
Date:
Sunday, 2.12.2018, 14:30
Place:
Taub 601

We introduce load-balanced fractional repetition (LBFR) codes, which are a strengthening of fractional repetition (FR) codes. LBFR codes have the additional property that multiple node failures can be sequentially repaired by downloading no more than one block from any other node. This allows for better use of the network, and can additionally reduce the number of disk reads necessary to repair multiple nodes. We characterize LBFR codes in terms of their adjacency graphs, and use this characterization to present explicit constructions LBFR codes with storage capacity comparable existing FR codes. Surprisingly, in some parameter regimes, our constructions of LBFR codes match the parameters of the best constructions of FR codes.

Based on work with Alexandra Porter and Mary Wootters

Back to the index of events