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)
  • 1