73 citations · 90 across the 14 of their papers we have counts for
17 papers · 1 filter
Extreme Points of the -LDP Polytope with Small Input Size and Arbitrary Output Sizes
Supriya Rawat, Myna Vajha, Gowtham R. Kurri +1
The structure of locally differentially private (LDP) mechanisms can be understood through the geometry of the corresponding privacy polytope. While the extreme points of the \( (ε…
On MDS Convertible Codes in the Merge Regime
Vinayak Ramkumar, Xiangliang Kong, G. Yeswanth Sai +2
In large-scale distributed storage systems, erasure coding is employed to ensure reliability against disk failures. Recent work by Kadekodi et al. demonstrates that adapting code p…
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…
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…
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…
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…
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…
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…
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…
Determining the Generalized Hamming Weight Hierarchy of the Binary Projective Reed-Muller Code
Vinayak Ramkumar, Myna Vajha, P. Vijay Kumar
Projective Reed-Muller codes correspond to subcodes of the Reed-Muller code in which the polynomials being evaluated to yield codewords, are restricted to be homogeneous. The Gener…
Small-d MSR Codes with Optimal Access, Optimal Sub-Packetization and Linear Field Size
Myna Vajha, S. B. Balaji, P. Vijay Kumar
This paper presents an explicit construction of a class of optimal-access, minimum storage regenerating (MSR) codes, for small values of the number of helper nodes. The constru…
On Lower Bounds on Sub-Packetization Level of MSR codes and On The Structure of Optimal-Access MSR Codes Achieving The Bound
S. B. Balaji, Myna Vajha, P. Vijay Kumar
We present two lower bounds on sub-packetization level of MSR codes with parameters where is the block length, dimension, number of helper nodes…
Binary, Shortened Projective Reed Muller Codes for Coded Private Information Retrieval
Myna Vajha, Vinayak Ramkumar, P. Vijay Kumar
The notion of a Private Information Retrieval (PIR) code was recently introduced by Fazeli, Vardy and Yaakobi who showed that this class of codes permit PIR at reduced levels of st…
An Explicit, Coupled-Layer Construction of a High-Rate Regenerating Code with Low Sub-Packetization Level, Small Field Size and
Birenjith Sasidharan, Myna Vajha, P. Vijay Kumar
This paper presents an explicit construction for an regenerating code (RGC) over a field having rate $…
An Explicit, Coupled-Layer Construction of a High-Rate MSR Code with Low Sub-Packetization Level, Small Field Size and All-Node Repair
Birenjith Sasidharan, Myna Vajha, P. Vijay Kumar
This paper presents an explicit construction for an regenerating code over a field operating at the Minimum Storage Regeneration (MSR) point.…
Outer Bounds on the Storage-Repair Bandwidth Tradeoff of Exact-Repair Regenerating Codes
Birenjith Sasidharan, N. Prakash, M. Nikhil Krishnan +3
In this paper, three outer bounds on the normalized storage-repair bandwidth (S-RB) tradeoff of regenerating codes having parameter set under the exact-repair (…