6 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…
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…
On MDS Convertible Codes in the Merge Regime
Vinayak Ramkumar, Xiangliang Kong, G. Yeswanth Sai +2
In large-scale distributed storage systems, erasure coding is employed to ensure reliability against disk failures. Recent work by Kadekodi et al. demonstrates that adapting code p…
Individual Confidential Computing of Polynomials over Non-Uniform Information
Saar Tarnopolsky, Zirui, Deng +3
In this paper, we address the problem of secure distributed computation in scenarios where user data is not uniformly distributed, extending existing frameworks that assume uniform…
Perfect Subset Privacy in Polynomial Computation via Reed-Muller Information Super-sets
Zirui Deng, Vinayak Ramkumar, Netanel Raviv
Delegating large-scale computations to service providers is a common practice which raises privacy concerns. This paper studies information-theoretic privacy-preserving delegation…
Quantum Locally Recoverable Codes via Good Polynomials
Sandeep Sharma, Vinayak Ramkumar, Itzhak Tamo
Locally recoverable codes (LRCs) with locality parameter can recover any erased code symbol by accessing other code symbols. This local recovery property is of great intere…