Combinatorial batch codes

By M. Paterson, Douglas R Stinson, R. Wei. 2009

76 citations recorded by the source corpus.

How researchers see this paper

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

PIR with Compressed Queries and Amortized Query Processing (2018, background): “Instead, they target load balancing in distributed storage systems [64, 67] and network switches [75], which have different requirements.”
Optimal fractional repetition codes and fractional repetition batch codes (2015, methodology): “can be performed by t different users in parallel, where each user gets a different symbol. In the following, we present our constructions of FRB codes which are based on the uniform batch codes from [12] and [17] and on FR codes considered in Sections III and IV. Theorem 13. 1) If K ; is a complete”
Batch codes through dense graphs without short cycles (2014, background): “We note that girth and graph representations have been considered before (see e.g. [1, 26] in the context of 2 -uniform combinatorial batch codes, that is replication based batch codes where each message symbol is repeated exactly twice.”
Fractional Repetition and Erasure Batch Codes (2014, background): “A ρ-uniform combinatorial batch code (CBC), denoted by ρ− (θ ,N = ρθ , t,n), is a batch code where each node stores a subset of data symbols, that is decoding is performed only by reading items from the nodes, and each symbol is stored in exactly ρ nodes [7, 10].”