11 citations · 12 across the 5 of their papers we have counts for
9 papers · 1 filter
Hierarchical Coded Gradient Aggregation Based on Layered MDS Codes
M. Nikhil Krishnan, Anoop Thomas, Birenjith Sasidharan
The growing privacy concerns and the communication costs associated with transmitting raw data have resulted in techniques like federated learning, where the machine learning model…
Adaptive relaying for streaming erasure codes in a three node relay network
Gustavo Kasper Facenda, M. Nikhil Krishnan, Elad Domanovitz +4
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…
Explicit Rate-Optimal Streaming Codes with Smaller Field Size
Myna Vajha, Vinayak Ramkumar, M. Nikhil Krishnan +1
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 or random er…
Codes for Distributed Storage
Vinayak Ramkumar, Myna Vajha, S. B. Balaji +3
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…
Staggered Diagonal Embedding Based Linear Field Size Streaming Codes
Vinayak Ramkumar, Myna Vajha, M. Nikhil Krishnan +1
An streaming code is a packet-level erasure code that can recover under a strict delay constraint of time units, from either a burst of erasures or else of ra…
Low Field-size, Rate-Optimal Streaming Codes for Channels With Burst and Random Erasures
M. Nikhil Krishnan, Deeptanshu Shukla, P. Vijay Kumar
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-b…