activity
20172025
most citedBinary, Shortened Projective Reed Muller Codes for Coded Private Information Retrieval

8 citations · 10 across the 5 of their papers we have counts for

collaborators
Showing cs.ITShow all

8 papers · 1 filter

cs.IT2021

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…

cs.IT2021

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…

cs.IT2021

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…

cs.IT2020

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…

cs.IT2020

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…

cs.IT2018

Erasure Coding for Distributed Storage: An Overview

S. B. Balaji, M. Nikhil Krishnan, Myna Vajha +3

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…