Efficient Decoding of Interleaved Low-Rank Parity-Check Codes

TL;DR

This paper introduces an efficient decoding algorithm for interleaved low-rank parity-check codes, demonstrating exponential reduction in failure rate with linear growth in complexity, advancing error correction methods.

Contribution

The paper presents a novel decoding algorithm for interleaved LRPC codes with proven bounds on failure rate and complexity, improving decoding efficiency.

Findings

Decoding failure rate decreases exponentially with interleaving order u.

Computational complexity increases linearly with interleaving order u.

The algorithm is both efficient and effective for interleaved LRPC codes.

Abstract

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.