collaborators
Showing cs.ITShow all

10 papers · 1 filter

cs.IT2026

CSS Quantum LRCs with Intersecting Recovery Sets: Constructions and Bounds

Evagoras Stylianou, Vinayak Ramkumar, Holger Boche +1

In this work, we study quantum locally recoverable codes (qLRCs) with locality , recovery sets per qudit, and intersection parameter . We first show that, assum…

cs.IT2026

Random Access Expectation in DNA Storage and Fountain Codes

Christoph Hofmeister, Rawad Bitar, Eitan Yaakobi

Motivated by DNA data storage, we study the expected number of coded symbols drawn from a linear code until a desired information symbol can be decoded - the random access expectat…

cs.IT2026

Coding Schemes for Document Exchange under Multiple Substring Edits

Hrishi Narayanan, Vinayak Ramkumar, Rawad Bitar +1

We study the document exchange problem under multiple substring edits. A substring edit in a string occurs when a substring of is replaced by…

cs.IT2026

On the Extension of Private Distributed Matrix Multiplication Schemes to the Grid Partition

Christoph Hofmeister, Razane Tajeddine, Antonia Wachter-Zeh +1

We consider polynomial codes for private distributed matrix multiplication (PDMM/SDMM). Existing codes for PDMM are either specialized for the outer product partitioning (OPP), or…

cs.IT2025

CAT and DOG: Improved Codes for Private Distributed Matrix Multiplication

Christoph Hofmeister, Rawad Bitar, Antonia Wachter-Zeh

We present novel constructions of polynomial codes for private distributed matrix multiplication (PDMM/SDMM) using outer product partitioning (OPP). We extend the degree table fram…

cs.IT2025

Between Close Enough to Reveal and Far Enough to Protect: a New Privacy Region for Correlated Data

Luis Maßny, Rawad Bitar, Fangwei Ye +1

When users make personal privacy choices, correlation between their data can cause inadvertent leakage about users who do not want to share their data by other users sharing their…