4 citations · 4 across the 6 of their papers we have counts for
6 papers
Design of MDP Convolutional Codes and Maximally Recoverable Codes Through the Lens of Matrix Completion
Sakshi Dang, Julia Lieb, Pedro Soto +1
The matrix completion problem provides a unifying lens through which many fundamental problems in coding theory can be viewed. In this paper, we investigate Locally Recoverable Cod…
A Matrix Completion Approach for the Construction of MDP Convolutional Codes
Sakshi Dang, Julia Lieb, Okko Makkonen +2
Maximum Distance Profile (MDP) convolutional codes are an important class of channel codes due to their maximal delay-constrained error correction capabilities. The design of MDP c…
A Low-Complexity Scheme for Multi-Message Private Information Retrieval
Ningze Wang, Anoosheh Heidarzadeh, Alex Sprintson
Private Information Retrieval (PIR) is a fundamental problem in the broader fields of security and privacy. In recent years, the problem has garnered significant attention from the…
Optimizing Leaky Private Information Retrieval Codes to Achieve Leakage Ratio Exponent
Wenyuan Zhao, Yu-Shin Huang, Chao Tian +1
We study the problem of leaky private information retrieval (L-PIR), where the amount of privacy leakage is measured by the pure differential privacy parameter, referred to as the…
A Linear Programming Approach to Private Information Retrieval
Anoosheh Heidarzadeh, Ningze Wang, Alex Sprintson
This work presents an algorithmic framework that uses linear programming to construct \emph{addition-based Private Information Retrieval (AB-PIR)} schemes, where retrieval is perfo…
Single-Server Private Linear Transformation: The Individual Privacy Case
Anoosheh Heidarzadeh, Nahid Esmati, Alex Sprintson
This paper considers the single-server Private Linear Transformation (PLT) problem with individual privacy guarantees. In this problem, there is a user that wishes to obtain in…