Fractional Repetition and Erasure Batch Codes

By Natalia Silberstein. 2014

11 citations recorded by the source corpus.

Batch codes are a family of codes that represent a distributed storage system (DSS) of $n$ nodes so that any batch of $t$ data symbols can be retrieved by reading at most one symbol from each node. Fractional repetition codes are a family of codes for DSS that enable efficient uncoded repairs of failed nodes. In this work these two families of codes are combined to obtain fractional repetition batch (FRB) codes which provide both uncoded repairs and parallel reads of subsets of stored symbols. In addition, new batch codes which can tolerate node failures are considered. This new family of batch codes is called erasure combinatorial batch codes (ECBCs). Some properties of FRB codes and ECBCs and examples of their constructions based on transversal designs and affine planes are presented.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Kim Laine
2. Hao Chen
3. Sebastian Angel
4. Srinath T. V. Setty
5. Justin Thaler
6. Michael Walfish

In Computer Networks and Communications

1. Sebastian Angel
2. Srinath T. V. Setty
3. Kim Laine
4. Hao Chen
5. Michael Walfish

Citations in the corpus

• PIR with Compressed Queries and Amortized Query Processing (2018, background): “, [58, 68, 69, 74]) but they either have no known constructions, or they seek additional properties (e.”