most citedA Tight Rate Bound and Matching Construction for Locally Recoverable Codes with Sequential Recovery From Any Number of Multiple Erasures

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

collaborators

1 paper

cs.IT2018★ 1 cited

A Tight Rate Bound and Matching Construction for Locally Recoverable Codes with Sequential Recovery From Any Number of Multiple Erasures

S. B. Balaji, Ganesh R. Kini, P. Vijay Kumar

By a locally recoverable code (LRC), we will in this paper, mean a linear code in which a given code symbol can be recovered by taking a linear combination of at most other cod…