11 citations · 12 across the 3 of their papers we have counts for
5 papers
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…
A Study on the Impact of Locality in the Decoding of Binary Cyclic Codes
M. Nikhil Krishnan, Bhagyashree Puranik, P. Vijay Kumar +2
In this paper, we study the impact of locality on the decoding of binary cyclic codes under two approaches, namely ordered statistics decoding (OSD) and trellis decoding. Given a b…
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 (…