Efficient Decoding of Interleaved Low-Rank Parity-Check Codes
Information Theory
2019-08-29 v1 Cryptography and Security
math.IT
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.
Cite
@article{arxiv.1908.10839,
title = {Efficient Decoding of Interleaved Low-Rank Parity-Check Codes},
author = {Julian Renner and Thomas Jerkovits and Hannes Bartz},
journal= {arXiv preprint arXiv:1908.10839},
year = {2019}
}