default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnna-Lena Horlemann-Trautmann
Person information
- affiliation: University of St. Gallen, Switzerland
- affiliation (former): University of Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j21]Violetta Weger
, Karan Khathuria, Anna-Lena Horlemann, Massimo Battaglioni, Paolo Santini, Edoardo Persichetti:
On the hardness of the Lee syndrome decoding problem. Adv. Math. Commun. 18(1): 233-266 (2024)- [j20]Nadja Willenborg, Anna-Lena Horlemann, Violetta Weger:
On the number of $ t $-Lee-error-correcting codes. Adv. Math. Commun. 18(2): 567-594 (2024) - [j19]Anina Gruica, Anna-Lena Horlemann, Alberto Ravagnani, Nadja Willenborg:
Densities of codes of various linearity degrees in translation-invariant metric spaces. Des. Codes Cryptogr. 92(3): 609-637 (2024) - [i48]Akram Baghban, Marc Newman, Anna-Lena Horlemann, Mehdi Ghiyasvand:
q-ary Sequential Locally Recoverable Codes from the Product Construction. CoRR abs/2401.07835 (2024) - [i47]Anna-Lena Horlemann, Karan Khathuria, Marc Newman, Amin Sakzad, Carlos Vela Cabello:
Lattice-Based Vulnerabilities in Lee Metric Post-Quantum Cryptosystems. CoRR abs/2409.16018 (2024) - [i46]Anna-Lena Horlemann, Karan Khathuria, Marc Newman, Amin Sakzad, Carlos Vela Cabello:
Lattice-Based Vulnerabilities in Lee Metric Post-Quantum Cryptosystems. IACR Cryptol. ePrint Arch. 2024: 1495 (2024) - 2023
- [j18]Daniele Bartoli, Martino Borello, Anna-Lena Horlemann:
Preface. Adv. Math. Commun. 17(1): i (2023) - [c14]Anna-Lena Horlemann, Violetta Weger, Nadja Willenborg:
On the Density of Codes over Finite Chain Rings. ITW 2023: 1-6 - [c13]Habibul Islam, Anna-Lena Horlemann:
Galois Hull Dimensions of Gabidulin Codes. ITW 2023: 42-46 - [i45]Felicitas Hörmann, Hannes Bartz, Anna-Lena Horlemann:
Distinguishing and Recovering Generalized Linearized Reed-Solomon Codes. CoRR abs/2304.00627 (2023) - [i44]Nadja Willenborg, Anna-Lena Horlemann, Violetta Weger:
On the Number of t-Lee-Error-Correcting Codes. CoRR abs/2305.05763 (2023) - [i43]Martino Borello, Anna-Lena Horlemann, Habibul Islam, Nadja Willenborg:
Dihedral Quantum Codes. CoRR abs/2310.15092 (2023) - 2022
- [c12]Felicitas Hörmann, Hannes Bartz, Anna-Lena Horlemann:
Distinguishing and Recovering Generalized Linearized Reed-Solomon Codes. CBCrypto 2022: 1-20 - [i42]Anina Gruica, Anna-Lena Horlemann, Alberto Ravagnani, Nadja Willenborg:
Densities of Codes of Various Linearity Degrees in Translation-Invariant Metric Spaces. CoRR abs/2208.10573 (2022) - [i41]Habibul Islam, Anna-Lena Horlemann:
Galois Hull Dimensions of Gabidulin Codes. CoRR abs/2211.05068 (2022) - [i40]Markus Grassl, Anna-Lena Horlemann, Violetta Weger:
The Subfield Metric and its Application to Quantum Error Correction. CoRR abs/2212.00431 (2022) - [i39]Anna-Lena Horlemann, Violetta Weger, Nadja Willenborg:
On the Density of Codes over Finite Chain Rings. CoRR abs/2212.09568 (2022) - 2021
- [j17]Anna-Lena Horlemann-Trautmann, Violetta Weger:
Information set decoding in the Lee metric with applications to cryptography. Adv. Math. Commun. 15(4): 677-699 (2021) - [j16]Tristram Bogart, Anna-Lena Horlemann-Trautmann, David A. Karpuk, Alessandro Neri, Mauricio Velasco:
Constructing Partial MDS Codes from Reducible Algebraic Curves. SIAM J. Discret. Math. 35(4): 2946-2970 (2021) - [c11]Anna-Lena Horlemann, Sven Puchinger, Julian Renner, Thomas Schamberger, Antonia Wachter-Zeh:
Information-Set Decoding with Hints. CBCrypto 2021: 60-83 - [i38]Eimear Byrne, Anna-Lena Horlemann, Karan Khathuria, Violetta Weger:
Density of Free Modules over Finite Chain Rings. CoRR abs/2106.09403 (2021) - [i37]Anna-Lena Horlemann-Trautmann, Sven Puchinger, Julian Renner, Thomas Schamberger, Antonia Wachter-Zeh:
Information-Set Decoding with Hints. IACR Cryptol. ePrint Arch. 2021: 279 (2021) - 2020
- [j15]Anna-Lena Horlemann-Trautmann, Alessandro Neri:
A complete classification of partial MDS (maximally recoverable) codes with one global parity. Adv. Math. Commun. 14(1): 69-88 (2020) - [j14]Alessandro Neri, Anna-Lena Horlemann-Trautmann:
Random construction of partial MDS codes. Des. Codes Cryptogr. 88(4): 711-725 (2020) - [i36]Violetta Weger, Massimo Battaglioni, Paolo Santini, Anna-Lena Horlemann-Trautmann, Edoardo Persichetti:
On the Hardness of the Lee Syndrome Decoding Problem. CoRR abs/2002.12785 (2020) - [i35]Tristram Bogart, Anna-Lena Horlemann-Trautmann, David A. Karpuk, Alessandro Neri, Mauricio Velasco:
Constructing Partial MDS Codes from Reducible Curves. CoRR abs/2007.14829 (2020) - [i34]Marco Baldi, Massimo Battaglioni, Franco Chiaraluce, Anna-Lena Horlemann-Trautmann, Edoardo Persichetti, Paolo Santini, Violetta Weger:
A New Path to Code-based Signatures via Identification Schemes with Restricted Errors. CoRR abs/2008.06403 (2020)
2010 – 2019
- 2019
- [j13]Heide Gluesing-Luerssen, Anna-Lena Horlemann-Trautmann:
Symbol Erasure Correction in Random Networks With Spread Codes. IEEE Trans. Inf. Theory 65(4): 2075-2091 (2019) - [j12]Ragnar Freij-Hollanti, Oliver W. Gnilke, Camilla Hollanti, Anna-Lena Horlemann-Trautmann, David A. Karpuk, Ivo Kubjas:
$t$ -Private Information Retrieval Schemes Using Transitive Codes. IEEE Trans. Inf. Theory 65(4): 2107-2118 (2019) - [c10]Alessandro Neri, Sven Puchinger, Anna-Lena Horlemann-Trautmann:
Invariants and Inequivalence of Linear Rank-Metric Codes. ISIT 2019: 2049-2053 - [i33]Anna-Lena Horlemann-Trautmann, Violetta Weger:
Information Set Decoding in the Lee Metric with Applications to Cryptography. CoRR abs/1903.07692 (2019) - [i32]Alessandro Neri, Sven Puchinger, Anna-Lena Horlemann-Trautmann:
Invariants and Inequivalence of Linear Rank-Metric Codes. CoRR abs/1905.11326 (2019) - [i31]Alessandro Neri, Sven Puchinger, Anna-Lena Horlemann-Trautmann:
Equivalence and Characterizations of Linear Rank-Metric Codes Based on Invariants. CoRR abs/1911.13059 (2019) - 2018
- [j11]Anna-Lena Horlemann-Trautmann, Kyle Marshall, Joachim Rosenthal:
Extension of Overbeck's attack for Gabidulin-based cryptosystems. Des. Codes Cryptogr. 86(2): 319-340 (2018) - [j10]Alessandro Neri, Anna-Lena Horlemann-Trautmann, Tovohery Randrianarisoa, Joachim Rosenthal:
On the genericity of maximum rank distance and Gabidulin codes. Des. Codes Cryptogr. 86(2): 341-363 (2018) - [j9]Anna-Lena Horlemann-Trautmann:
Message encoding and retrieval for spread and cyclic orbit codes. Des. Codes Cryptogr. 86(2): 365-386 (2018) - [i30]Alessandro Neri, Anna-Lena Horlemann-Trautmann:
Random Construction of Partial MDS Codes. CoRR abs/1801.05848 (2018) - 2017
- [j8]Anna-Lena Horlemann-Trautmann, Kyle Marshall:
New criteria for MRD and Gabidulin codes and some Rank-Metric code constructions. Adv. Math. Commun. 11(3): 533-548 (2017) - [j7]Anna-Lena Horlemann-Trautmann, Felice Manganiello, Michael Braun, Joachim Rosenthal:
Correction to "Cyclic Orbit Codes". IEEE Trans. Inf. Theory 63(11): 7616 (2017) - [i29]Anna-Lena Horlemann-Trautmann, Alessandro Neri:
A Complete Classification of Partial-MDS (Maximally Recoverable) Codes with One Global Parity. CoRR abs/1707.00847 (2017) - [i28]Heide Gluesing-Luerssen, Anna-Lena Horlemann-Trautmann:
Symbol Erasure Correction Capability of Spread Codes. CoRR abs/1710.06323 (2017) - [i27]Ragnar Freij-Hollanti, Oliver W. Gnilke, Camilla Hollanti, Anna-Lena Horlemann-Trautmann, David A. Karpuk, Ivo Kubjas:
t-Private Information Retrieval Schemes Using Transitive Codes. CoRR abs/1712.02850 (2017) - 2016
- [c9]Anna-Lena Horlemann-Trautmann, Kyle Marshall, Joachim Rosenthal:
Considerations for rank-based cryptosystems. ISIT 2016: 2544-2548 - [i26]Alessandro Neri, Anna-Lena Horlemann-Trautmann, Tovohery Randrianarisoa, Joachim Rosenthal:
On the Genericity of Maximum Rank Distance and Gabidulin Codes. CoRR abs/1605.05972 (2016) - 2015
- [j6]Natalia Silberstein, Anna-Lena Trautmann:
Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks. IEEE Trans. Inf. Theory 61(7): 3937-3953 (2015) - [c8]Amin Sakzad, Anna-Lena Trautmann, Emanuele Viterbo:
Cross-packing lattices for the Rician fading channel. ITW 2015: 1-5 - [i25]Anna-Lena Horlemann-Trautmann, Kyle Marshall:
New Criteria for MRD and Gabidulin Codes and some Rank-Metric Code Constructions. CoRR abs/1507.08641 (2015) - [i24]Anna-Lena Horlemann-Trautmann, Kyle Marshall, Joachim Rosenthal:
Extension of Overbeck's Attack for Gabidulin Based Cryptosystems. CoRR abs/1511.01549 (2015) - 2014
- [j5]Joachim Rosenthal, Natalia Silberstein, Anna-Lena Trautmann:
On the geometry of balls in the Grassmannian and list decoding of lifted Gabidulin codes. Des. Codes Cryptogr. 73(2): 393-416 (2014) - [j4]Felice Manganiello, Anna-Lena Trautmann:
Spread decoding in extension fields. Finite Fields Their Appl. 25: 94-105 (2014) - [c7]Anna-Lena Trautmann:
Message encoding for spread and orbit codes. ISIT 2014: 2594-2598 - [c6]Margreta Kuijper, Anna-Lena Trautmann:
List-decoding Gabidulin codes via interpolation and the euclidean algorithm. ISITA 2014: 343-347 - [c5]Anna-Lena Trautmann, Emanuele Viterbo:
Cross-Error Correcting Integer Codes over ℤ2m. ISITA 2014: 526-530 - [c4]Margreta Kuijper, Anna-Lena Trautmann:
Iterative list-decoding of Gabidulin codes via Gröbner based interpolation. ITW 2014: 581-585 - [i23]Anna-Lena Trautmann:
Message Encoding for Spread and Orbit Codes. CoRR abs/1401.0615 (2014) - [i22]Margreta Kuijper, Anna-Lena Trautmann:
List-Decoding Gabidulin Codes via Interpolation and the Euclidean Algorithm. CoRR abs/1404.5716 (2014) - [i21]Natalia Silberstein, Anna-Lena Trautmann:
Subspace Codes based on Graph Matchings, Ferrers Diagrams and Pending Blocks. CoRR abs/1404.6723 (2014) - [i20]Margreta Kuijper, Anna-Lena Trautmann:
Iterative List-Decoding of Gabidulin Codes via Gröbner Based Interpolation. CoRR abs/1405.7152 (2014) - [i19]Anna-Lena Trautmann, Emanuele Viterbo:
Cross-Error Correcting Integer Codes over Z2m. CoRR abs/1405.7464 (2014) - [i18]Margreta Kuijper, Anna-Lena Trautmann:
Gröbner Bases for Linearized Polynomials. CoRR abs/1406.4600 (2014) - [i17]Margreta Kuijper, Anna-Lena Trautmann:
The Predictable Leading Monomial Property for Linearized Polynomials and Gabidulin List-Decoding. CoRR abs/1408.2303 (2014) - [i16]Anna-Lena Trautmann:
Message Encoding and Retrieval for Spread and Cyclic Orbit Codes. CoRR abs/1409.0610 (2014) - 2013
- [j3]Anna-Lena Trautmann:
Isometry and automorphisms of constant dimension codes. Adv. Math. Commun. 7(2): 147-160 (2013) - [j2]Joachim Rosenthal, Anna-Lena Trautmann:
A complete characterization of irreducible cyclic orbit codes and their Plücker embedding. Des. Codes Cryptogr. 66(1-3): 275-289 (2013) - [j1]Anna-Lena Trautmann, Felice Manganiello, Michael Braun, Joachim Rosenthal:
Cyclic Orbit Codes. IEEE Trans. Inf. Theory 59(11): 7386-7404 (2013) - [c3]Natalia Silberstein, Anna-Lena Trautmann:
New lower bounds for constant dimension codes. ISIT 2013: 514-518 - [i15]Anna-Lena Trautmann:
A lower bound for constant dimension codes from multi-component lifted MRD codes. CoRR abs/1301.1918 (2013) - [i14]Anna-Lena Trautmann, Natalia Silberstein, Joachim Rosenthal:
List Decoding of Lifted Gabidulin Codes via the Plücker Embedding. CoRR abs/1301.2165 (2013) - [i13]Natalia Silberstein, Anna-Lena Trautmann:
New Lower Bounds for Constant Dimension Codes. CoRR abs/1301.5961 (2013) - [i12]Joachim Rosenthal, Natalia Silberstein, Anna-Lena Trautmann:
On the Geometry of Balls in the Grassmannian and List Decoding of Lifted Gabidulin Codes. CoRR abs/1309.0403 (2013) - 2012
- [i11]Joachim Rosenthal, Anna-Lena Trautmann:
A Complete Characterization of Irreducible Cyclic Orbit Codes and their Plücker Embedding. CoRR abs/1201.3825 (2012) - [i10]Anna-Lena Trautmann:
Plücker Embedding of Cyclic Orbit Codes. CoRR abs/1205.1823 (2012) - [i9]Felix Fontein, Kyle Marshall, Joachim Rosenthal, Davide Schipani, Anna-Lena Trautmann:
On Burst Error Correction and Storage Security of Noisy Data. CoRR abs/1205.5148 (2012) - [i8]Anna-Lena Trautmann:
Isometry and Automorphisms of Constant Dimension Codes. CoRR abs/1205.5465 (2012) - [i7]Joachim Rosenthal, Anna-Lena Trautmann:
Decoding of Subspace Codes, a Problem of Schubert Calculus over Finite Fields. CoRR abs/1209.2887 (2012) - [i6]Kyle Marshall, Joachim Rosenthal, Davide Schipani, Anna-Lena Trautmann:
Subspace Fuzzy Vault. CoRR abs/1210.7190 (2012) - 2011
- [c2]Felice Manganiello, Anna-Lena Trautmann, Joachim Rosenthal:
On conjugacy classes of subgroups of the general linear group and cyclic orbit codes. ISIT 2011: 1916-1920 - [i5]Anna-Lena Trautmann, Joachim Rosenthal:
A Complete Characterization of Irreducible Cyclic Orbit Codes. CoRR abs/1102.3167 (2011) - [i4]Felice Manganiello, Anna-Lena Trautmann, Joachim Rosenthal:
On conjugacy classes of subgroups of the general linear group and cyclic orbit codes. CoRR abs/1102.3350 (2011) - [i3]Felice Manganiello, Anna-Lena Trautmann:
Spread Decoding in Extension Fields. CoRR abs/1108.5881 (2011) - [i2]Anna-Lena Trautmann, Joachim Rosenthal:
New Improvements on the Echelon-Ferrers Construction. CoRR abs/1110.2417 (2011) - [i1]Anna-Lena Trautmann, Felice Manganiello, Michael Braun, Joachim Rosenthal:
Cyclic Orbit Codes. CoRR abs/1112.1238 (2011) - 2010
- [c1]Anna-Lena Trautmann, Felice Manganiello, Joachim Rosenthal:
Orbit codes - A new concept in the area of network coding. ITW 2010: 1-4
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-17 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
