Consider a large database of n data items that need to be stored using m servers.
We study how to encode information so that a large number k of read requests can be performed \textit{in parallel} while the rate remains constant (and ideally approaches one).
This problem is equivalent ... more >>>