activity
20102017
most citedOptimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction

587 citations · 1k across the 12 of their papers we have counts for

collaborators

13 papers

cs.IT2017

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 $…

cs.IT2015★ 4 cited

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…

cs.IT2015★ 7 cited

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…

cs.IT2015★ 9 cited

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…

cs.IT2014★ 75 cited

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…

cs.IT2014★ 24 cited

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…

cs.IT2013

An Improved Outer Bound on the Storage-Repair-Bandwidth Tradeoff of Exact-Repair Regenerating Codes

Birenjith Sasidharan, Kaushik Senthoor, P. Vijay Kumar

In this paper we establish an improved outer bound on the storage-repair-bandwidth tradeoff of regenerating codes under exact repair. The result shows that in particular, it is not…

cs.IT2013★ 15 cited

Explicit MBR All-Symbol Locality Codes

Govinda M. Kamath, Natalia Silberstein, N. Prakash +5

Node failures are inevitable in distributed storage systems (DSS). To enable efficient repair when faced with such failures, two main techniques are known: Regenerating codes, i.e.…

cs.IT2012

Optimal Linear Codes with a Local-Error-Correction Property

N. Prakash, Govinda M. Kamath, V. Lalitha +1

Motivated by applications to distributed storage, Gopalan \textit{et al} recently introduced the interesting notion of information-symbol locality in a linear code. By this it is m…

cs.IT2012★ 20 cited

Regenerating Codes for Errors and Erasures in Distributed Storage

K. V. Rashmi, Nihar B. Shah, Kannan Ramchandran +1

Regenerating codes are a class of codes proposed for providing reliability of data and efficient repair of failed nodes in distributed storage systems. In this paper, we address th…

cs.IT2011★ 54 cited

Enabling Node Repair in Any Erasure Code for Distributed Storage

K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar

Erasure codes are an efficient means of storing data across a network in comparison to data replication, as they tend to reduce the amount of data stored in the network and offer i…

cs.IT2010★ 587 cited

Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction

K. V. Rashmi, Nihar B. Shah, P. Vijay Kumar

Regenerating codes are a class of distributed storage codes that optimally trade the bandwidth needed for repair of a failed node with the amount of data stored per node of the net…

cs.IT2010★ 237 cited

Interference Alignment in Regenerating Codes for Distributed Storage: Necessity and Code Constructions

Nihar B. Shah, K. V. Rashmi, P. Vijay Kumar +1

Regenerating codes are a class of recently developed codes for distributed storage that, like Reed-Solomon codes, permit data recovery from any arbitrary k of n nodes. However rege…