Name
Abstract | ||
|---|---|---|
We define and analyze low-rank parity-check (LRPC) codes over extension rings of the finite chain ring Z
<sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">pr</sub>
, 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 space-time codes and network coding. We give a decoding algorithm based on simple linear-algebraic 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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/ISIT44484.2020.9174384 | 2020 IEEE International Symposium on Information Theory (ISIT) |
Keywords | DocType | ISSN |
low-rank parity-check codes,extension rings,finite chain ring Z,positive integer,LRPC codes,finite fields,cryptographic applications,Gabidulin codes,finite principle ideal rings,space-time codes,network coding,errors whose rank,free rank,integers modulo,prime power | Conference | 2157-8095 |
ISBN | Citations | PageRank |
978-1-7281-6433-5 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Renner Julian | 1 | 0 | 0.68 |
| Sven Puchinger | 2 | 25 | 14.73 |
| Antonia Wachter-Zeh | 3 | 129 | 33.65 |
| Camilla Hollanti | 4 | 308 | 40.21 |
| Freij-Hollanti Ragnar | 5 | 0 | 0.34 |