43 citations · 121 across the 14 of their papers we have counts for
5 papers · 1 filter
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…
Bounds on Binary Locally Repairable Codes Tolerating Multiple Erasures
Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck +2
Recently, locally repairable codes has gained significant interest for their potential applications in distributed storage systems. However, most constructions in existence are ove…
Traffic Minimizing Caching and Latent Variable Distributions of Order Statistics
Joonas Pääkkönen, Prathapasinghe Dharmawansa, Ragnar Freij-Hollanti +2
Given a statistical model for the request frequencies and sizes of data objects in a caching system, we derive the probability density of the size of the file that accounts for the…
Matroid Theory and Storage Codes: Bounds and Constructions
Ragnar Freij-Hollanti, Camilla Hollanti, Thomas Westerbäck
Recent research on distributed storage systems (DSSs) has revealed interesting connections between matroid theory and locally repairable codes (LRCs). The goal of this chapter is t…
Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns
Razane Tajeddine, Oliver W. Gnilke, David Karpuk +3
In Private Information Retrieval (PIR), one wants to download a file from a database without revealing to the database which file is being downloaded. Much attention has been paid…