K. P. Prasanth

Learn More
This paper considers linear, binary codes having locality parameter r, that are capable of recovering from t ≥ 2 erasures and which additionally, possess short block length. Both parallel (through orthogonal parity checks) and sequential recovery is considered here. In the case of parallel repair, minimum-block-length constructions are characterized(More)
In this paper, binary codes with locality for four erasures are considered. An upper bound on the rate of this class of codes is derived. An optimal construction for codes meeting the bound is also provided. The construction is based on regular bipartite graphs of girth 6 and employs the sequential approach of locally recovering from multiple erasures. An(More)
  • 1