  An efficient decoding algorithm for horizontally u-interleaved LRPC codes is
proposed and analyzed. Upper bounds on the decoding failure rate and the
computational complexity of the algorithm are derived. It is shown that
interleaving reduces the decoding failure rate exponentially in the
interleaving order u whereas the computational complexity grows linearly.
