Rank-Metric Codes is a class of error-correcting codes in code-based cryptography where the distance between codewords is measured by the rank of the difference of their associated matrices over a finite field, distinguishing it from other metric codes by its reliance on the rank metric rather than the Hamming or Lee metric.
160
Publications
7.9K
Citations
190
Authors
128
Institutions
Publications per year
2017–2026
50
Publications
160
Codes With Local Regeneration and Erasure Correction
Govinda M. Kamath, N. Prakash, V. Lalitha et al. · IEEE Transactions on Information Theory · 2014 · 200 citations
Optimal locally repairable codes via rank-metric codes
Natalia Silberstein, Ankit Singh Rawat, O. Ozan Koyluoglu et al. · 2013 · 189 citations
1–5 of 160
Authors
190
- FR
13
h-index
- MG
10
h-index
- DS
10
h-index
- ZY
9
h-index
- PL
7
h-index
1–5 of 190
Institutions
128
University of Toronto
Toronto, Canada
15 h-index
34 publications
5K citations
Technion – Israel Institute of Technology
Haifa, Israel
11 h-index
17 publications
967 citations
Technical University of Munich
Munich, Germany
11 h-index
16 publications
2.3K citations
Lehigh University
Bethlehem, United States
8 h-index
14 publications
416 citations
University of Zurich
Zurich, Switzerland
8 h-index
13 publications
507 citations
Université de Limoges
Limoges, France
6 h-index
13 publications
513 citations
Universität Ulm
Ulm, Germany
6 h-index
12 publications
500 citations
Moscow Institute of Physics and Technology
Dolgoprudnyy, Russia
6 h-index
8 publications
447 citations
1–8 of 128
Venues
- IEEE Transactions on Information Theory
46 publications · 4.3K citations
30
h-index
- Designs Codes and Cryptography
14 publications · 455 citations
12
h-index
- arXiv (Cornell University)
Repository · 5 publications · 90 citations
5
h-index
- ArXiv.org
Repository · 3 publications · 72 citations
3
h-index
- HAL (Le Centre pour la Communication Scientifique Directe)
Repository · 3 publications · 122 citations
3
h-index
1–5