Linear Batch Codes

By Helger Lipmaa, Vitaly Skachek. 2014

29 citations recorded by the source corpus.

In an application, where a client wants to obtain many symbols from a large database, it is often desirable to balance the load. Batch codes (introduced by Ishai et al. in STOC 2004) do exactly that: the large database is divided between many servers, so that the client has to only make a small number of queries to every server to obtain sufficient information to reconstruct all desired symbols.

Subfields: 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 Computer Networks and Communications

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.”
Batch codes through dense graphs without short cycles (2014, background): “ﬂoor or the ceiling of 1+. 19 distance. Here, we note that Lipmaa and Skachek have recently shown that a binary linear batch code which supports any k-request patterns has minimum distance at least k[22]. Here, we describe a straightforward yet powerful way to combine the notion of load balancing in”