N
Nihar B. Shah
Researcher at Carnegie Mellon University
Publications - 156
Citations - 7244
Nihar B. Shah is an academic researcher from Carnegie Mellon University. The author has contributed to research in topics: Distributed data store & Computer science. The author has an hindex of 39, co-authored 133 publications receiving 6502 citations. Previous affiliations of Nihar B. Shah include Indian Institute of Science & Microsoft.
Papers
More filters
Journal ArticleDOI
Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
TL;DR: In this article, the authors presented optimal constructions of minimum bandwidth regenerating (MBR) codes for all values of [n, k, d] and (b) minimum storage regeneration (MSR) code for all value n ≥ 2k-2, using a new product-matrix framework.
Journal ArticleDOI
Optimal Exact-Regenerating Codes for Distributed Storage at the MSR and MBR Points via a Product-Matrix Construction
TL;DR: To the best of the knowledge, these are the first constructions of exact-regenerating codes that allow the number n of nodes in the network, to be chosen independent of the other parameters.
Proceedings ArticleDOI
Explicit construction of optimal exact regenerating codes for distributed storage
TL;DR: In this article, exact regenerating codes are constructed for the minimum bandwidth point on the storage-repair bandwidth tradeoff, relevant to distributed-mail-server applications and shown to yield necessary and sufficient conditions on a linear code to possess the exact regeneration property as well as prove the uniqueness of their construction.
Journal ArticleDOI
Distributed Storage Codes With Repair-by-Transfer and Nonachievability of Interior Points on the Storage-Bandwidth Tradeoff
TL;DR: An explicit, exact-repair code for the point on the storage-bandwidth tradeoff corresponding to the minimum possible repair bandwidth, and an ability of the code to perform repair through mere transfer of data as repair by transfer are named.
Proceedings ArticleDOI
One Extra Bit of Download Ensures Perfectly Private Information Retrieval
TL;DR: This paper designs an explicit erasure code and PIR algorithm that requires only one extra bit of download to provide perfect privacy, and establishes the precise capacity of PIR with respect to the metric of download.