activity
20092026
most citedA family of optimal locally recoverable codes

618 citations · 1.2k across the 56 of their papers we have counts for

collaborators
Showing 2025Show all

6 papers · 1 filter

quant-ph2025

Pure-State Quantum Tomography with Minimal Rank-One POVMs

Dan Edidin, Ivan Gonzalez, Itzhak Tamo

Quantum state tomography seeks to reconstruct an unknown state from measurement statistics. A finite measurement (POVM) is \emph{pure-state informationally complete} (PSI-Complete)…

cs.IT2025

New Bounds and Constructions for Variable Packet-Error Coding

Xiangliang Kong, Xin Wang, Ron M. Roth +1

In this paper, we consider the problem of variable packet-error coding, which emerges in network communication scenarios where a source transmits information to a destination throu…

cs.IT2025

New Capacity Bounds for PIR on Graph and Multigraph-Based Replicated Storage

Xiangliang Kong, Shreya Meel, Thomas Jacob Maranzatto +2

In this paper, we study the problem of private information retrieval (PIR) in both graph-based and multigraph-based replication systems, where each file is stored on exactly two se…

cs.IT2025

Bounds on Box Codes

Michael Langberg, Moshe Schwartz, Itzhak Tamo

Let be the minimum length of a -ary code of size and minimum distance . Bounding is a fundamental problem that lies at the heart of coding theory. T…

cs.IT2025

Private Information Retrieval on Multigraph-Based Replicated Storage

Shreya Meel, Xiangliang Kong, Thomas Jacob Maranzatto +2

We consider the private information retrieval (PIR) problem for a multigraph-based replication system, where each set of files is stored on two of the servers according to an u…

cs.IT2025

Making it to First: The Random Access Problem in DNA Storage

Avital Boruchovsky, Ohad Elishco, Ryan Gabrys +3

In this paper, we study the Random Access Problem in DNA storage, which addresses the challenge of retrieving a specific information strand from a DNA-based storage system. In this…