| Cyclic orbit codes AL Trautmann, F Manganiello, M Braun, J Rosenthal IEEE Transactions on Information Theory 59 (11), 7386-7404, 2013 | 127 | 2013 |
| Subspace codes based on graph matchings, Ferrers diagrams, and pending blocks N Silberstein, AL Trautmann IEEE Transactions on Information Theory 61 (7), 3937-3953, 2015 | 89 | 2015 |
| New criteria for MRD and Gabidulin codes and some rank-metric code constructions AL Horlemann-Trautmann, K Marshall Advances in Mathematics of Communications 11 (3), 533-548, 2017 | 81 | 2017 |
| On the genericity of maximum rank distance and Gabidulin codes A Neri, AL Horlemann-Trautmann, T Randrianarisoa, J Rosenthal Designs, Codes and Cryptography 86 (2), 341-363, 2018 | 76 | 2018 |
| New improvements on the echelon-Ferrers construction AL Trautmann, J Rosenthal Proceedings of the 19th International Symposium on Mathematical Theory of …, 2011 | 63 | 2011 |
| Orbit codes—a new concept in the area of network coding AL Trautmann, F Manganiello, J Rosenthal 2010 IEEE Information Theory Workshop, 1-4, 2010 | 60 | 2010 |
| Extension of Overbeck’s attack for Gabidulin-based cryptosystems AL Horlemann-Trautmann, K Marshall, J Rosenthal Designs, Codes and Cryptography 86 (2), 319-340, 2018 | 59 | 2018 |
| Morphological diversity strongly constrains synaptic connectivity and plasticity MW Reimann, AL Horlemann, S Ramaswamy, EB Muller, H Markram Cerebral Cortex 27 (9), 4570-4585, 2017 | 57 | 2017 |
| On the hardness of the Lee syndrome decoding problem V Weger, K Khathuria, AL Horlemann, M Battaglioni, P Santini, ... Advances in Mathematics of Communication 18 (1), 233-266, 2024 | 48* | 2024 |
| Information set decoding in the Lee metric with applications to cryptography AL Horlemann-Trautmann, V Weger Advances in Mathematics of Communications 15 (4), 2021 | 46 | 2021 |
| A new path to code-based signatures via identification schemes with restricted errors M Baldi, M Battaglioni, F Chiaraluce, AL Horlemann-Trautmann, ... Advances in Mathematics of Communications 19 (5), 2025 | 42* | 2025 |
| A complete characterization of irreducible cyclic orbit codes and their Plücker embedding J Rosenthal, AL Trautmann Designs, Codes and Cryptography 66 (1), 275-289, 2013 | 39 | 2013 |
| -private information retrieval schemes using transitive codes R Freij-Hollanti, OW Gnilke, C Hollanti, AL Horlemann-Trautmann, ... IEEE Transactions on Information Theory 65 (4), 2107-2118, 2018 | 37 | 2018 |
| Considerations for rank-based cryptosystems AL Horlemann-Trautmann, K Marshall, J Rosenthal 2016 IEEE International Symposium on Information Theory (ISIT), 2544-2548, 2016 | 35 | 2016 |
| Constructions of constant dimension codes AL Horlemann-Trautmann, J Rosenthal Network Coding and Subspace Designs, 25-42, 2018 | 30 | 2018 |
| Isometry and automorphisms of constant dimension codes AL Trautmann Advances in Mathematics of Communications 7 (2), 147-160, 2013 | 30 | 2013 |
| Information-set decoding with hints AL Horlemann, S Puchinger, J Renner, T Schamberger, A Wachter-Zeh Code-Based Cryptography Workshop, 60-83, 2021 | 28 | 2021 |
| On conjugacy classes of subgroups of the general linear group and cyclic orbit codes F Manganiello, AL Trautmann, J Rosenthal 2011 IEEE International Symposium on Information Theory Proceedings, 1916-1920, 2011 | 25 | 2011 |
| New lower bounds for constant dimension codes N Silberstein, AL Trautmann 2013 IEEE International Symposium on Information Theory, 514-518, 2013 | 22 | 2013 |
| Density of free modules over finite chain rings E Byrne, AL Horlemann, K Khathuria, V Weger Linear Algebra and its Applications 651, 1-25, 2022 | 21 | 2022 |
Joachim RosenthalProfessor of Mathematics, University of ZurichVerified email at math.uzh.ch
