Generalization of low rank parity-check (LRPC) codes over the ring of integers modulo a positive integer

Abstract Following the work of Gaborit et al. (in: The international workshop on coding and cryptography (WCC 13), 2013) defining LRPC codes over finite fields, Renner et al. (in: IEEE international symposium on information theory, ISIT 2020, 2020) defined LRPC codes over the ring of integers modulo a prime power, inspired by the paper of Kamche and Mouaha (IEEE Trans Inf Theory 65(12):7718–7735, 2019) which explored rank metric codes over finite principal ideal rings. In this work, we successfully extend the work of Renner et al. by constructing LRPC codes over the ring $$\mathbb {Z}_{m}$$ <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mml:msub> <mml:mi>Z</mml:mi> <mml:mi>m</mml:mi> </mml:msub> </mml:math> which is not a chain ring. We give a decoding algorithm and we study the failure probability of the decoder.