activity
20172025
most citedUniform Minors in Maximally Recoverable Codes

3 citations · 4 across the 4 of their papers we have counts for

collaborators
Showing cs.ITShow all

5 papers · 1 filter

cs.IT2025

Function-Correcting Codes With Data Protection

Charul Rajput, B. Sundar Rajan, Ragnar Freij-Hollanti +1

Function-correcting codes (FCCs) are designed to provide error protection for the value of a function computed on the data. Existing work typically focuses solely on protecting the…

cs.IT2019★ 3 cited

Uniform Minors in Maximally Recoverable Codes

Matthias Grezet, Thomas Westerbäck, Ragnar Freij-Hollanti +1

In this letter, locally recoverable codes with maximal recoverability are studied with a focus on identifying the MDS codes resulting from puncturing and shortening. By using matro…

cs.IT2018

Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes

Matthias Grezet, Ragnar Freij-Hollanti, Thomas Westerbäck +1

Locally repairable codes (LRCs) have gained significant interest for the design of large distributed storage systems as they allow a small number of erased nodes to be recovered by…

cs.IT2018

Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers

Razane Tajeddine, Oliver W. Gnilke, David Karpuk +2

The problem of Private Information Retrieval (PIR) from coded storage systems with colluding, byzantine, and unresponsive servers is considered. An explicit scheme using an …

cs.IT2017★ 1 cited

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…