Rank-Metric Codes Over Finite Principal Ideal Rings and Applications

2019 ◽  
Vol 65 (12) ◽  
pp. 7718-7735 ◽  
Author(s):  
Hermann Tchatchiem Kamche ◽  
Christophe Mouaha
Author(s):  
Franck Rivel Kamwa Djomou ◽  
Hervé Talé Kalachi ◽  
Emmanuel Fouotsa

AbstractFollowing 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}$$ Z m which is not a chain ring. We give a decoding algorithm and we study the failure probability of the decoder.


Author(s):  
Vladimir Sidorenko ◽  
Wenhui Li ◽  
Gerhard Kramer

2019 ◽  
Vol 52 (1) ◽  
pp. 1-19 ◽  
Author(s):  
Elisa Gorla ◽  
Relinde Jurrius ◽  
Hiram H. López ◽  
Alberto Ravagnani

2019 ◽  
Vol 581 ◽  
pp. 128-144 ◽  
Author(s):  
Shuangqing Liu ◽  
Yanxun Chang ◽  
Tao Feng

2019 ◽  
Vol 3 (4) ◽  
pp. 614-643
Author(s):  
Eimear Byrne ◽  
Alessandro Neri ◽  
Alberto Ravagnani ◽  
John Sheekey

2020 ◽  
Vol 604 ◽  
pp. 92-128
Author(s):  
Eimear Byrne ◽  
Giuseppe Cotardo ◽  
Alberto Ravagnani

Sign in / Sign up

Export Citation Format

Share Document