Gabidulin Codes is a class of linear rank-metric codes that achieves maximum rank distance, distinguished by its construction based on evaluation of linearized polynomials over finite fields.
69
Publications
3.6K
Citations
93
Authors
59
Institutions
Publications per year
2017–2026
22
Parents
Publications
69
Optimal locally repairable codes via rank-metric codes
Natalia Silberstein, Ankit Singh Rawat, O. Ozan Koyluoglu et al. · 2013 · 189 citations
The new construction of rank codes
Alexander Kshevetskiy, E.M. Gabidulin · 2005 · 122 citations
1–5 of 69
Authors
93
- AW
7
h-index
- FR
7
h-index
- AS
6
h-index
- OO
6
h-index
- VS
6
h-index
1–5 of 93
Institutions
59
Universität Ulm
Ulm, Germany
9 h-index
17 publications
579 citations
University of Toronto
Toronto, Canada
8 h-index
13 publications
1.6K citations
Institut de recherche mathématique de Rennes
Rennes, France
6 h-index
7 publications
232 citations
University of Zurich
Zurich, Switzerland
5 h-index
11 publications
373 citations
The University of Texas at Austin
Austin, United States
5 h-index
20 publications
1.2K citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
7 publications
215 citations
Technical University of Munich
Munich, Germany
4 h-index
4 publications
1.3K citations
Lehigh University
Bethlehem, United States
4 h-index
8 publications
154 citations
1–8 of 59
Venues
- IEEE Transactions on Information Theory
10 publications · 1.5K citations
10
h-index
- Designs Codes and Cryptography
8 publications · 278 citations
8
h-index
- arXiv (Cornell University)
Repository · 6 publications · 105 citations
6
h-index
- Advances in Mathematics of Communications
3 publications · 74 citations
3
h-index
- HAL (Le Centre pour la Communication Scientifique Directe)
Repository · 2 publications · 118 citations
2
h-index
1–5