research
∙
02/18/2022
Private Information Retrieval from Colluding and Byzantine Servers with Binary Reed-Muller Codes
In this work, a flexible and robust private information retrieval (PIR) ...
share
research
∙
09/07/2020
Information Hiding Using Matroid Theory
Inspired by problems in Private Information Retrieval, we consider the s...
research
∙
01/14/2020
Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power
We define and analyze low-rank parity-check (LRPC) codes over extension ...
research
∙
06/06/2019
Uniform Minors in Maximally Recoverable Codes
In this letter, locally recoverable codes with maximal recoverability ar...
research
∙
03/29/2019
On the Capacity of Private Information Retrieval from Coded, Colluding, and Adversarial Servers
In this work, we first prove the capacity of coded, linear symmetric pri...
research
∙
12/17/2018
Cyclic Codes with Locality and Availability
In this work the cyclic locally repairable code (LRC) construction by Ta...
research
∙
11/07/2018
Private Information Retrieval Schemes with Regenerating Codes
A private information retrieval (PIR) scheme allows a user to retrieve a...
research
∙
10/19/2018
Alphabet-Dependent Bounds for Linear Locally Repairable Codes Based on Residual Codes
Locally repairable codes (LRC) have gained significant interest for the ...
research
∙
06/20/2018
Private Information Retrieval from Coded Storage Systems with Colluding, Byzantine, and Unresponsive Servers
The problem of Private Information Retrieval (PIR) from coded storage sy...
research
∙
06/01/2018
Private Streaming with Convolutional Codes
Recently, information-theoretic private information retrieval (PIR) from...
research
∙
02/11/2018
Robust Private Information Retrieval from Coded Systems with Byzantine and Colluding Servers
A private information retrieval (PIR) scheme on coded storage systems wi...
research
∙
12/07/2017
