  In this work it is shown that locally repairable codes (LRCs) can be
list-decoded efficiently beyond the Johnson radius for a large range of
parameters by utilizing the local error-correction capabilities. The
corresponding decoding radius is derived and the asymptotic behavior is
analyzed. A general list-decoding algorithm for LRCs that achieves this radius
is proposed along with an explicit realization for LRCs that are subcodes of
Reed--Solomon codes (such as, e.g., Tamo--Barg LRCs). Further, a probabilistic
algorithm of low complexity for unique decoding of LRCs is given and its
success probability is analyzed.
  The second part of this work considers error decoding of LRCs and partial
maximum distance separable (PMDS) codes through interleaved decoding. For a
specific class of LRCs the success probability of interleaved decoding is
investigated. For PMDS codes, it is shown that there is a wide range of
parameters for which interleaved decoding can increase their decoding radius
beyond the minimum distance such that the probability of successful decoding
approaches $1$ when the code length goes to infinity.
