Anna-Lena Horlemann-Trautmann

Affiliations:
  • University of St. Gallen, Switzerland
  • University of Zurich, Switzerland (former)


According to our database1, Anna-Lena Horlemann-Trautmann authored at least 54 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
q-ary Sequential Locally Recoverable Codes from the Product Construction.
CoRR, 2024

2023
Dihedral Quantum Codes.
CoRR, 2023

On the Number of t-Lee-Error-Correcting Codes.
CoRR, 2023

Preface.
Adv. Math. Commun., 2023

Galois Hull Dimensions of Gabidulin Codes.
Proceedings of the IEEE Information Theory Workshop, 2023

On the Density of Codes over Finite Chain Rings.
Proceedings of the IEEE Information Theory Workshop, 2023

2022
The Subfield Metric and its Application to Quantum Error Correction.
CoRR, 2022

Densities of Codes of Various Linearity Degrees in Translation-Invariant Metric Spaces.
CoRR, 2022

Distinguishing and Recovering Generalized Linearized Reed-Solomon Codes.
Proceedings of the Code-Based Cryptography - 10th International Workshop, 2022

2021
Constructing Partial MDS Codes from Reducible Algebraic Curves.
SIAM J. Discret. Math., 2021

Information-Set Decoding with Hints.
IACR Cryptol. ePrint Arch., 2021

Density of Free Modules over Finite Chain Rings.
CoRR, 2021

Information set decoding in the Lee metric with applications to cryptography.
Adv. Math. Commun., 2021

2020
Random construction of partial MDS codes.
Des. Codes Cryptogr., 2020

A New Path to Code-based Signatures via Identification Schemes with Restricted Errors.
CoRR, 2020

Constructing Partial MDS Codes from Reducible Curves.
CoRR, 2020

On the Hardness of the Lee Syndrome Decoding Problem.
CoRR, 2020

A complete classification of partial MDS (maximally recoverable) codes with one global parity.
Adv. Math. Commun., 2020

2019
Symbol Erasure Correction in Random Networks With Spread Codes.
IEEE Trans. Inf. Theory, 2019

$t$ -Private Information Retrieval Schemes Using Transitive Codes.
IEEE Trans. Inf. Theory, 2019

Equivalence and Characterizations of Linear Rank-Metric Codes Based on Invariants.
CoRR, 2019

Invariants and Inequivalence of Linear Rank-Metric Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
On the genericity of maximum rank distance and Gabidulin codes.
Des. Codes Cryptogr., 2018

Message encoding and retrieval for spread and cyclic orbit codes.
Des. Codes Cryptogr., 2018

Extension of Overbeck's attack for Gabidulin-based cryptosystems.
Des. Codes Cryptogr., 2018

2017
Correction to "Cyclic Orbit Codes".
IEEE Trans. Inf. Theory, 2017

Symbol Erasure Correction Capability of Spread Codes.
CoRR, 2017

New criteria for MRD and Gabidulin codes and some Rank-Metric code constructions.
Adv. Math. Commun., 2017

2016
Considerations for rank-based cryptosystems.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks.
IEEE Trans. Inf. Theory, 2015

Cross-packing lattices for the Rician fading channel.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

2014
Spread decoding in extension fields.
Finite Fields Their Appl., 2014

On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes.
Des. Codes Cryptogr., 2014

Cross-Error Correcting Integer Codes over Z<sub>2<sup>m</sup></sub>.
CoRR, 2014

The Predictable Leading Monomial Property for Linearized Polynomials and Gabidulin List-Decoding.
CoRR, 2014

Gröbner Bases for Linearized Polynomials.
CoRR, 2014

Iterative list-decoding of Gabidulin codes via Gröbner based interpolation.
Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Cross-Error Correcting Integer Codes over ℤ2m.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

List-decoding Gabidulin codes via interpolation and the euclidean algorithm.
Proceedings of the International Symposium on Information Theory and its Applications, 2014

Message encoding for spread and orbit codes.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Cyclic Orbit Codes.
IEEE Trans. Inf. Theory, 2013

A complete characterization of irreducible cyclic orbit codes and their Plücker embedding.
Des. Codes Cryptogr., 2013

List Decoding of Lifted Gabidulin Codes via the Plücker Embedding
CoRR, 2013

A lower bound for constant dimension codes from multi-component lifted MRD codes
CoRR, 2013

Isometry and automorphisms of constant dimension codes.
Adv. Math. Commun., 2013

New lower bounds for constant dimension codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Subspace Fuzzy Vault
CoRR, 2012

Decoding of Subspace Codes, a Problem of Schubert Calculus over Finite Fields
CoRR, 2012

On Burst Error Correction and Storage Security of Noisy Data
CoRR, 2012

Plücker Embedding of Cyclic Orbit Codes
CoRR, 2012

2011
New Improvements on the Echelon-Ferrers Construction
CoRR, 2011

A Complete Characterization of Irreducible Cyclic Orbit Codes
CoRR, 2011

On conjugacy classes of subgroups of the general linear group and cyclic orbit codes.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
Orbit codes - A new concept in the area of network coding.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010


  Loading...