Efficient Decoding of Interleaved Low-Rank Parity-Check Codes
arXiv:1908.10839v1
AI Analysis
This work addresses decoding efficiency for error-correcting codes, likely incremental as it builds on existing LRPC code methods.
The paper tackles the problem of decoding interleaved low-rank parity-check codes by proposing an efficient algorithm, showing that interleaving reduces the decoding failure rate exponentially with order u while computational complexity increases linearly.
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.