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 >>>

A recent work of Li and Wootters (2021) shows a redundancy lower bound of \Omega(\sqrt{Nk}) for systematic linear k-batch codes of block length N by looking at the O(k) tensor power of the dual code. In this note, we present an alternate proof of their result via a linear independence ... more >>>