Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Ramkumar, Vinayak"'
Locally recoverable codes (LRCs) with locality parameter $r$ can recover any erased code symbol by accessing $r$ other code symbols. This local recovery property is of great interest in large-scale distributed classical data storage systems as it lea
Externí odkaz:
http://arxiv.org/abs/2411.01504
Minimum storage regenerating (MSR) codes are a class of maximum distance separable (MDS) array codes capable of repairing any single failed node by downloading the minimum amount of information from each of the helper nodes. However, MSR codes requir
Externí odkaz:
http://arxiv.org/abs/2408.16584
Delegating large-scale computations to service providers is a common practice which raises privacy concerns. This paper studies information-theoretic privacy-preserving delegation of data to a service provider, who may further delegate the computatio
Externí odkaz:
http://arxiv.org/abs/2405.05567
Given a real dataset and a computation family, we wish to encode and store the dataset in a distributed system so that any computation from the family can be performed by accessing a small number of nodes. In this work, we focus on the families of li
Externí odkaz:
http://arxiv.org/abs/2405.05845
A typical setup in many machine learning scenarios involves a server that holds a model and a user that possesses data, and the challenge is to perform inference while safeguarding the privacy of both parties. Private Inference has been extensively e
Externí odkaz:
http://arxiv.org/abs/2311.13686
Linear real-valued computations over distributed datasets are common in many applications, most notably as part of machine learning inference. In particular, linear computations that are quantized, i.e., where the coefficients are restricted to a pre
Externí odkaz:
http://arxiv.org/abs/2305.06101
For a convolutional code in the presence of a symbol erasure channel, the information debt $I(t)$ at time $t$ provides a measure of the number of additional code symbols required to recover all message symbols up to time $t$. Information-debt-optimal
Externí odkaz:
http://arxiv.org/abs/2305.06303
Streaming codes are a class of packet-level erasure codes that are designed with the goal of ensuring recovery in low-latency fashion, of erased packets over a communication network. It is well-known in the streaming code literature, that diagonally
Externí odkaz:
http://arxiv.org/abs/2109.03168
Streaming codes are a class of packet-level erasure codes that ensure packet recovery over a sliding window channel which allows either a burst erasure of size $b$ or $a$ random erasures within any window of size $(\tau+1)$ time units, under a strict
Externí odkaz:
http://arxiv.org/abs/2105.04432