  Locally recoverable codes deal with the task of reconstructing a lost symbol
by relying on a portion of the remaining coordinates smaller than an
information set. We consider the case of codes over finite chain rings,
generalizing known results and bounds for codes over fields. In particular, we
propose a new family of locally recoverable codes by extending a construction
proposed in 2014 by Tamo and Barg, and we discuss its optimality.
