17 citations · 30 across the 6 of their papers we have counts for
6 papers
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…
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…
A Tight Rate Bound and a Matching Construction for Locally Recoverable Codes with Sequential Recovery From Any Number of Multiple Erasures
S. B. Balaji, Ganesh R. Kini, P. Vijay Kumar
An code is said to be locally recoverable in the presence of a single erasure, and with locality parameter , if each of the code symbols of $\mathcal{C…
Binary Codes with Locality for Multiple Erasures Having Short Block Length
S. B. Balaji, K. P. Prasanth, P. Vijay Kumar
The focus of this paper is on linear, binary codes with locality having locality parameter , that are capable of recovering from erasures and that moreover, have short…
On Partial Maximally-Recoverable and Maximally-Recoverable Codes
S. B. Balaji, P. Vijay Kumar
An [n, k] linear code C that is subject to locality constraints imposed by a parity check matrix H0 is said to be a maximally recoverable (MR) code if it can recover from any erasu…