1 citations · 2 across the 2 of their papers we have counts for
4 papers
Failure Probability Analysis for Partial Extraction from Invertible Bloom Filters
Ivo Kubjas, Vitaly Skachek
Invertible Bloom Filter (IBF) is a data structure, which employs a small set of hash functions. An IBF allows for an efficient insertion and, with high probability, for an efficien…
t-Private Information Retrieval Schemes Using Transitive Codes
Ragnar Freij-Hollanti, Oliver W. Gnilke, Camilla Hollanti +3
This paper presents private information retrieval (PIR) schemes for coded storage with colluding servers, which are not restricted to maximum distance separable (MDS) codes. PIR sc…
Two-Party Function Computation on the Reconciled Data
Ivo Kubjas, Vitaly Skachek
In this paper, we initiate a study of a new problem termed function computation on the reconciled data, which generalizes a set reconciliation problem in the literature. Assume a d…
Data Dissemination Problem in Wireless Networks
Ivo Kubjas, Vitaly Skachek
In this work, we formulate and study a data dissemination problem, which can be viewed as a generalization of the index coding problem and of the data exchange problem to networks…