Name
Abstract | ||
|---|---|---|
This work compares the performance of software implementations of different Gabidulin decoders. The parameter sets used within the comparison stem from their applications in recently proposed cryptographic schemes. The complexity analysis of the decoders is recalled, counting the occurrence of each operation within the respective decoders. It is shown that knowing the number of operations may be misleading when comparing different algorithms as the run-time of the implementation depends on the instruction set of the device on which the algorithm is executed. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1109/ACCT51235.2020.9383242 | 2020 Algebraic and Combinatorial Coding Theory (ACCT) |
Keywords | DocType | ISBN |
Decoder,Finite extension field,Gabidulin code | Conference | 978-1-6654-0288-0 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Johannes Kunz | 1 | 0 | 0.34 |
| Julian Renner | 2 | 2 | 1.38 |
| Georg Maringer | 3 | 0 | 0.34 |
| Thomas Schamberger | 4 | 0 | 0.34 |
| Antonia Wachter-Zeh | 5 | 129 | 33.65 |