Orbit codes - A new concept in the area of network coding. - Anna-Lena Trautmann; Felice Manganiello; Joachim Rosenthal (ITW, 2010)

On conjugacy classes of subgroups of the general linear group and cyclic orbit codes. - Felice Manganiello; Anna-Lena Trautmann; Joachim Rosenthal (ISIT, 2011)

A Complete Characterization of Irreducible Cyclic Orbit Codes - Anna-Lena Trautmann; Joachim Rosenthal (CoRR, 2011)

New Improvements on the Echelon-Ferrers Construction - Anna-Lena Trautmann; Joachim Rosenthal (CoRR, 2011)

Plücker Embedding of Cyclic Orbit Codes - Anna-Lena Trautmann (CoRR, 2012)

On Burst Error Correction and Storage Security of Noisy Data - Felix Fontein; Kyle Marshall; Joachim Rosenthal; Davide Schipani; Anna-Lena Trautmann (CoRR, 2012)

Decoding of Subspace Codes, a Problem of Schubert Calculus over Finite Fields - Joachim Rosenthal; Anna-Lena Trautmann (CoRR, 2012)

Subspace Fuzzy Vault - Kyle Marshall; Joachim Rosenthal; Davide Schipani; Anna-Lena Trautmann (CoRR, 2012)

New lower bounds for constant dimension codes. - Natalia Silberstein; Anna-Lena Trautmann (ISIT, 2013)

Isometry and automorphisms of constant dimension codes. - Anna-Lena Trautmann (Adv. Math. Commun., 2013)

A lower bound for constant dimension codes from multi-component lifted MRD codes - Anna-Lena Trautmann (CoRR, 2013)

List Decoding of Lifted Gabidulin Codes via the Plücker Embedding - Anna-Lena Trautmann; Natalia Silberstein; Joachim Rosenthal (CoRR, 2013)

A complete characterization of irreducible cyclic orbit codes and their Plücker embedding. - Joachim Rosenthal; Anna-Lena Trautmann (Des. Codes Cryptogr., 2013)

Cyclic Orbit Codes. - Anna-Lena Trautmann; Felice Manganiello; Michael Braun; Joachim Rosenthal (IEEE Trans. Inf. Theory, 2013)

Message encoding for spread and orbit codes. - Anna-Lena Trautmann (ISIT, 2014)

List-decoding Gabidulin codes via interpolation and the euclidean algorithm. - Margreta Kuijper; Anna-Lena Trautmann (ISITA, 2014)

Cross-Error Correcting Integer Codes over ℤ2m. - Anna-Lena Trautmann; Emanuele Viterbo (ISITA, 2014)

Iterative list-decoding of Gabidulin codes via Gröbner based interpolation. - Margreta Kuijper; Anna-Lena Trautmann (ITW, 2014)

Gröbner Bases for Linearized Polynomials. - Margreta Kuijper; Anna-Lena Trautmann (CoRR, 2014)

The Predictable Leading Monomial Property for Linearized Polynomials and Gabidulin List-Decoding. - Margreta Kuijper; Anna-Lena Trautmann (CoRR, 2014)

Cross-Error Correcting Integer Codes over Z2m. - Anna-Lena Trautmann; Emanuele Viterbo (CoRR, 2014)

On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes. - Joachim Rosenthal; Natalia Silberstein; Anna-Lena Trautmann (Des. Codes Cryptogr., 2014)

Spread decoding in extension fields. - Felice Manganiello; Anna-Lena Trautmann (Finite Fields Their Appl., 2014)

Cross-packing lattices for the Rician fading channel. - Amin Sakzad; Anna-Lena Trautmann; Emanuele Viterbo (ITW, 2015)

Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks. - Natalia Silberstein; Anna-Lena Trautmann (IEEE Trans. Inf. Theory, 2015)

Considerations for rank-based cryptosystems. - Anna-Lena Horlemann-Trautmann; Kyle Marshall; Joachim Rosenthal (ISIT, 2016)

New criteria for MRD and Gabidulin codes and some Rank-Metric code constructions. - Anna-Lena Horlemann-Trautmann; Kyle Marshall (Adv. Math. Commun., 2017)

Symbol Erasure Correction Capability of Spread Codes. - Heide Gluesing-Luerssen; Anna-Lena Horlemann-Trautmann (CoRR, 2017)

Correction to "Cyclic Orbit Codes". - Anna-Lena Horlemann-Trautmann; Felice Manganiello; Michael Braun; Joachim Rosenthal (IEEE Trans. Inf. Theory, 2017)

Extension of Overbeck's attack for Gabidulin-based cryptosystems. - Anna-Lena Horlemann-Trautmann; Kyle Marshall; Joachim Rosenthal (Des. Codes Cryptogr., 2018)

Message encoding and retrieval for spread and cyclic orbit codes. - Anna-Lena Horlemann-Trautmann (Des. Codes Cryptogr., 2018)

On the genericity of maximum rank distance and Gabidulin codes. - Alessandro Neri 002; Anna-Lena Horlemann-Trautmann; Tovohery Randrianarisoa; Joachim Rosenthal (Des. Codes Cryptogr., 2018)

Invariants and Inequivalence of Linear Rank-Metric Codes. - Alessandro Neri 002; Sven Puchinger; Anna-Lena Horlemann-Trautmann (ISIT, 2019)

Equivalence and Characterizations of Linear Rank-Metric Codes Based on Invariants. - Alessandro Neri 002; Sven Puchinger; Anna-Lena Horlemann-Trautmann (CoRR, 2019)

$t$ -Private Information Retrieval Schemes Using Transitive Codes. - Ragnar Freij-Hollanti; Oliver W. Gnilke; Camilla Hollanti; Anna-Lena Horlemann-Trautmann; David A. Karpuk; Ivo Kubjas (IEEE Trans. Inf. Theory, 2019)

Symbol Erasure Correction in Random Networks With Spread Codes. - Heide Gluesing-Luerssen; Anna-Lena Horlemann-Trautmann (IEEE Trans. Inf. Theory, 2019)

A complete classification of partial MDS (maximally recoverable) codes with one global parity. - Anna-Lena Horlemann-Trautmann; Alessandro Neri 002 (Adv. Math. Commun., 2020)

On the Hardness of the Lee Syndrome Decoding Problem. - Violetta Weger; Massimo Battaglioni; Paolo Santini; Anna-Lena Horlemann-Trautmann; Edoardo Persichetti (CoRR, 2020)

Constructing Partial MDS Codes from Reducible Curves. - Tristram Bogart; Anna-Lena Horlemann-Trautmann; David A. Karpuk; Alessandro Neri 002; Mauricio Velasco (CoRR, 2020)

A New Path to Code-based Signatures via Identification Schemes with Restricted Errors. - Marco Baldi; Massimo Battaglioni; Franco Chiaraluce; Anna-Lena Horlemann-Trautmann; Edoardo Persichetti; Paolo Santini; Violetta Weger (CoRR, 2020)

Random construction of partial MDS codes. - Alessandro Neri 002; Anna-Lena Horlemann-Trautmann (Des. Codes Cryptogr., 2020)

Information set decoding in the Lee metric with applications to cryptography. - Anna-Lena Horlemann-Trautmann; Violetta Weger (Adv. Math. Commun., 2021)

Density of Free Modules over Finite Chain Rings. - Eimear Byrne; Anna-Lena Horlemann; Karan Khathuria; Violetta Weger (CoRR, 2021)

Information-Set Decoding with Hints. - Anna-Lena Horlemann-Trautmann; Sven Puchinger; Julian Renner; Thomas Schamberger; Antonia Wachter-Zeh (IACR Cryptol. ePrint Arch., 2021)

Constructing Partial MDS Codes from Reducible Algebraic Curves. - Tristram Bogart; Anna-Lena Horlemann-Trautmann; David A. Karpuk; Alessandro Neri 002; Mauricio Velasco (SIAM J. Discret. Math., 2021)

Distinguishing and Recovering Generalized Linearized Reed-Solomon Codes. - Felicitas Hörmann; Hannes Bartz; Anna-Lena Horlemann (CBCrypto, 2022)

The Subfield Metric and its Application to Quantum Error Correction. - Markus Grassl; Anna-Lena Horlemann; Violetta Weger (CoRR, 2022)

On the Density of Codes over Finite Chain Rings. - Anna-Lena Horlemann; Violetta Weger; Nadja Willenborg (ITW, 2023)

Galois Hull Dimensions of Gabidulin Codes. - Habibul Islam; Anna-Lena Horlemann (ITW, 2023)

Preface. - Daniele Bartoli; Martino Borello; Anna-Lena Horlemann (Adv. Math. Commun., 2023)

Dihedral Quantum Codes. - Martino Borello; Anna-Lena Horlemann; Habibul Islam; Nadja Willenborg (CoRR, 2023)

On the hardness of the Lee syndrome decoding problem. - Violetta Weger; Karan Khathuria; Anna-Lena Horlemann; Massimo Battaglioni; Paolo Santini; Edoardo Persichetti (Adv. Math. Commun., 2024)

On the number of $ t $-Lee-error-correcting codes. - Nadja Willenborg; Anna-Lena Horlemann; Violetta Weger (Adv. Math. Commun., 2024)

q-ary Sequential Locally Recoverable Codes from the Product Construction. - Akram Baghban; Marc Newman; Anna-Lena Horlemann; Mehdi Ghiyasvand (CoRR, 2024)

Lattice-Based Vulnerabilities in Lee Metric Post-Quantum Cryptosystems. - Anna-Lena Horlemann; Karan Khathuria; Marc Newman; Amin Sakzad; Carlos Vela Cabello (IACR Cryptol. ePrint Arch., 2024)

Densities of codes of various linearity degrees in translation-invariant metric spaces. - Anina Gruica; Anna-Lena Horlemann; Alberto Ravagnani; Nadja Willenborg (Des. Codes Cryptogr., 2024)

Equivalence of Families of Polycyclic Codes over Finite Fields. - Hassan Ou-azzou; Anna-Lena Horlemann (CoRR, 2025)

Bounds and Equivalence of Skew Polycyclic Codes over Finite Fields. - Hassan Ou-azzou; Anna-Lena Horlemann; Nuh Aydin (CoRR, 2025)