3 citations · 7 across the 12 of their papers we have counts for
13 papers
Recovery Models for Linear Batch Codes
Baran Düzgün, Henk D. L. Hollmann, Ago-Erik Riet +2
Various types of recovery algorithms for batch codes have been considered previously, including asynchronous recovery and recovery algorithms arising from Almost Affinely Disjoint…
On the Minimum Length of Functional Batch Codes with Small Recovery Sets
Kristiina Oksner, Henk D. L. Hollmann, Ago-Erik Riet +1
Batch codes are of potential use for load balancing and private information retrieval in distributed data storage systems. Recently, a special case of batch codes, termed functiona…
New constructions of unbalanced -free bipartite graphs
Baran Düzgün, Ago-Erik Riet, Vladislav Taranchuk
In 1979, Erdős conjectured that if , then . This conjecture was disproven by several papers and the current best-known bounds for th…
PIR Codes, Unequal-Data-Demand Codes, and the Griesmer Bound
Henk D. L. Hollmann, Martin Puškin, Ago-Erik Riet
Unequal Error-Protecting (UEP) codes are error-correcting (EC) codes designed to protect some parts of the encoded data better than other parts. Here, we introduce a similar genera…
Equal Requests are Asymptotically Hardest for Data Recovery
Jüri Lember, Ago-Erik Riet
In a distributed storage system serving hot data, the data recovery performance becomes important, captured e.g. by the service rate. We give partial evidence for it being hardest…
On some batch code properties of the simplex code
Henk D. L. Hollmann, Karan Khathuria, Ago-Erik Riet +1
The binary -dimensional simplex code is known to be a -batch code and is conjectured to be a -functional batch code. Here, we offer a simple, constructive proo…