Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Krishnan, M. Nikhil"'
The growing privacy concerns and the communication costs associated with transmitting raw data have resulted in techniques like federated learning, where the machine learning models are trained at the edge nodes, and the parameter updates are shared
Externí odkaz:
http://arxiv.org/abs/2311.14116
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
In distributed computing, slower nodes (stragglers) usually become a bottleneck. Gradient Coding (GC), introduced by Tandon et al., is an efficient technique that uses principles of error-correcting codes to distribute gradient computation in the pre
Externí odkaz:
http://arxiv.org/abs/2211.13802
Autor:
Facenda, Gustavo Kasper, Krishnan, M. Nikhil, Domanovitz, Elad, Fong, Silas L., Khisti, Ashish, Tan, Wai-Tian, Apostolopoulos, John
This paper investigates adaptive streaming codes over a three-node relayed network. In this setting, a source node transmits a sequence of message packets to a destination through a relay. The source-to-relay and relay-to-destination links are unreli
Externí odkaz:
http://arxiv.org/abs/2203.05102
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
Autor:
Ramkumar, Vinayak, Vajha, Myna, Balaji, S. B., Krishnan, M. Nikhil, Sasidharan, Birenjith, Kumar, P. Vijay
This chapter deals with the topic of designing reliable and efficient codes for the storage and retrieval of large quantities of data over storage devices that are prone to failure. For long, the traditional objective has been one of ensuring reliabi
Externí odkaz:
http://arxiv.org/abs/2010.01344
An $(a,b,\tau)$ streaming code is a packet-level erasure code that can recover under a strict delay constraint of $\tau$ time units, from either a burst of $b$ erasures or else of $a$ random erasures, occurring within a sliding window of time duratio
Externí odkaz:
http://arxiv.org/abs/2005.07113
In this paper, we design erasure-correcting codes for channels with burst and random erasures, when a strict decoding delay constraint is in place. We consider the sliding-window-based packet erasure model proposed by Badr et al., where any time-wind
Externí odkaz:
http://arxiv.org/abs/1903.06210
Autor:
Balaji, S. B., Krishnan, M. Nikhil, Vajha, Myna, Ramkumar, Vinayak, Sasidharan, Birenjith, Kumar, P. Vijay
In a distributed storage system, code symbols are dispersed across space in nodes or storage units as opposed to time. In settings such as that of a large data center, an important consideration is the efficient repair of a failed node. Efficient rep
Externí odkaz:
http://arxiv.org/abs/1806.04437
In this paper, we study vector codes with all-symbol locality, where the local code is either a Minimum Bandwidth Regenerating (MBR) code or a Minimum Storage Regenerating (MSR) code. In the first part, we present vector codes with all-symbol MBR loc
Externí odkaz:
http://arxiv.org/abs/1804.00564