2015/01/21 by Natalia Silberstein, Tuvi Etzion, Silberstein, Natalia +1
Computer Science · #Advanced Data Storage Technologies #Caching and Content Delivery #Cellular Automata and Applications #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.1501.05177
openalex publication_date 2015/01/21 · openalex created_date 2022/10/04 · openalex updated_date 2026/07/28
Fractional repetition (FR) codes is a family of codes for distributed storage\nsystems (DSS) that allow uncoded exact repairs with minimum repair bandwidth.\nIn this work, we consider a bound on the maximum amount of data that can be\nstored using an FR code. Optimal FR codes which attain this bound are\npresented. The constructions of these FR codes are based on families of regular\ngraphs, such as Tur 'an graphs and graphs with large girth; and on\ncombinatorial designs, such as transversal designs and generalized polygons. In\naddition, based on a connection between FR codes and batch codes, we propose a\nnew family of codes for DSS, called fractional repetition batch codes, which\nallow uncoded efficient exact repairs and load balancing which can be performed\nby several users in parallel.\n