Projects per year
Abstract
We define and analyze lowrank paritycheck (LRPC) codes over extension rings of the finite chain ring {{\mathbb{Z}}{{p^r}}}, where p is a prime and r is a positive integer. LRPC codes have originally been proposed by Gaborit et al. (2013) over finite fields for cryptographic applications. The adaption to finite rings is inspired by a recent paper by Kamche et al. (2019), which constructed Gabidulin codes over finite principle ideal rings with applications to spacetime codes and network coding. We give a decoding algorithm based on simple linearalgebraic operations. Further, we derive an upper bound on the failure probability of the decoder. The upper bound is valid for errors whose rank is equal to the free rank.
Original language  English 

Title of host publication  2020 IEEE International Symposium on Information Theory, ISIT 2020  Proceedings 
Publisher  IEEE 
Pages  1924 
Number of pages  6 
ISBN (Electronic)  9781728164328 
DOIs  
Publication status  Published  Jun 2020 
MoE publication type  A4 Article in a conference publication 
Event  IEEE International Symposium on Information Theory  Los Angeles, United States Duration: 21 Jul 2020 → 26 Jul 2020 
Publication series
Name  IEEE International Symposium on Information Theory  Proceedings 

Publisher  IEEE 
Volume  2020June 
ISSN (Print)  21578095 
Conference
Conference  IEEE International Symposium on Information Theory 

Abbreviated title  ISIT 
Country  United States 
City  Los Angeles 
Period  21/07/2020 → 26/07/2020 
Fingerprint Dive into the research topics of 'LowRank ParityCheck Codes over the Ring of Integers Modulo a Prime Power'. Together they form a unique fingerprint.
Projects
 1 Finished

Numbertheoretic and combinatorial tools for private and secure cloud services
Hollanti, C., Westerbäck, T., Arabi Kakavandfaramani, M., Grezet, M. & Damir, M.
01/07/2016 → 30/06/2018
Project: Academy of Finland: Other research funding