277 citations · 719 across the 36 of their papers we have counts for
41 papers
Explicit Information-Debt-Optimal Streaming Codes With Small Memory
M. Nikhil Krishnan, Myna Vajha, Vinayak Ramkumar +1
For a convolutional code in the presence of a symbol erasure channel, the information debt at time provides a measure of the number of additional code symbols required t…
Rate-Optimal Streaming Codes Over the Three-Node Decode-And-Forward Relay Network
Shubhransh Singhvi, Gayathri R., P. Vijay Kumar
In this paper, we study the three-node Decode-and-Forward (D&F) relay network subject to random and burst packet erasures. The source wishes to transmit an infinite stream of packe…
Locally Recoverable Streaming Codes for Packet-Erasure Recovery
Vinayak Ramkumar, Myna Vajha, P. Vijay Kumar
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 networ…
Generalized Simple Streaming Codes from MDS Codes
Vinayak Ramkumar, Myna Vajha, P. Vijay Kumar
Streaming codes represent a packet-level FEC scheme for achieving reliable, low-latency communication. In the literature on streaming codes, the commonly-assumed Gilbert-Elliott ch…
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…
On the Performance Analysis of Streaming Codes over the Gilbert-Elliott Channel
Myna Vajha, Vinayak Ramkumar, Mayank Jhamtani +1
The Gilbert-Elliot (GE) channel is a commonly-accepted model for packet erasures in networks. Streaming codes are a class of packet-level erasure codes designed to provide reliable…