587 citations · 706 across the 8 of their papers we have counts for
13 papers
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 $…
Information-theoretically Secure Erasure Codes for Distributed Storage
Nihar B. Shah, K. V. Rashmi, Kannan Ramchandran +1
Repair operations in distributed storage systems potentially expose the data to malicious acts of passive eavesdroppers or active adversaries, which can be detrimental to the secur…
Codes With Hierarchical Locality
Birenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar
In this paper, we study the notion of {\em codes with hierarchical locality} that is identified as another approach to local recovery from multiple erasures. The well-known class o…
A High-Rate MSR Code With Polynomial Sub-Packetization Level
Birenjith Sasidharan, Gaurav Kumar Agarwal, P. Vijay Kumar
We present a high-rate -MSR code with a sub-packetization level that is polynomial in the dimension of the code. While polynomial sub-packetization level was achie…
Layered, Exact-Repair Regenerating Codes Via Embedded Error Correction and Block Designs
Chao Tian, Birenjith Sasidharan, Vaneet Aggarwal +2
A new class of exact-repair regenerating codes is constructed by stitching together shorter erasure correction codes, where the stitching pattern can be viewed as block designs. Th…
Codes with Locality for Two Erasures
N. Prakash, V. Lalitha, P. Vijay Kumar
In this paper, we study codes with locality that can recover from two erasures via a sequence of two local, parity-check computations. By a local parity-check computation, we mean…