  Typically, locally repairable codes (LRCs) and regenerating codes have been
studied independently of each other, and it has not been clear how the
parameters of one relate to those of the other. In this paper, a novel
connection between locally repairable codes and exact regenerating codes is
established. Via this connection, locally repairable codes are interpreted as
exact regenerating codes. Further, some of these codes are shown to perform
better than time-sharing codes between minimum bandwidth regenerating and
minimum storage regenerating codes.
