17 citations · 30 across the 6 of their papers we have counts for
Showing 2016 · cs.ITShow all
2 papers · 2 filters
cs.IT2016
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…
cs.IT2016★ 17 cited
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…