24 papers
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…
SeFoRA: Sketch-Aggregated Federated Low-Rank Adaptation with Heterogeneous Client Ranks
Yue Xia, Tayyebeh Jahani-Nezhad, Mayank Bakshi +1
We consider federated parameter efficient fine-tuning of large neural networks with low-rank adaptation (LoRA,~Hu et al.\ 2022). Combining LoRA with federated PEFT introduces chall…
Private Information Retrieval for Large-Scale DNA-Based Data Storage
Gökberk ErdoÄan, Daniella Bar-Lev, Rawad Bitar +2
We investigate Private Information Retrieval (PIR) in the context of synthetic DNA-based data storage. While PIR is a well-studied primitive for digital databases, extending it to…
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…
Fundamental Limits of Decentralized Self-Regulating Random Walks
Ali Khalesi, Rawad Bitar
We study self-regulating random walks (SRRWs), a decentralized mechanism for maintaining a stable population of mobile tokens on a graph. Tokens move by random walks, may be lost a…
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…