Square Fractional Repetition Codes for Distributed Storage Systems

Bing Zhu, Shigeng Zhang, Weiping Wang

Abstract: Fractional repetition (FR) codes have been proposed for distributed storage systems to achieve low-complexity repair of failed nodes, i.e., each contacted helper node in the repair process simply transfers a portion of stored data to the replacement node without arithmetic operations. In this paper, we propose square fractional repetition (SFR) codes, which have the key feature that a failed storage node can be repaired by two helper nodes, thus achieving the smallest non-trivial repair degree. Moreover, we show that determining the supported file size of SFR codes is equivalent to solving an integer partition problem, and an algorithm is then presented.