Antonia Wachter-Zeh

Orcid: 0000-0002-5174-1947

Affiliations:
  • Technical University of Munich, Institute for Communications Engineering, Germany


According to our database1, Antonia Wachter-Zeh authored at least 146 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
Error-Correcting Codes for Nanopore Sequencing.
IEEE Trans. Inf. Theory, July, 2024

LowMS: a new rank metric code-based KEM without ideal structure.
Des. Codes Cryptogr., April, 2024

Sparsity and Privacy in Secret Sharing: A Fundamental Trade-Off.
IEEE Trans. Inf. Forensics Secur., 2024

How to Lose Some Weight - A Practical Template Syndrome Decoding Attack.
IACR Cryptol. ePrint Arch., 2024

Sequential Decoding of Multiple Traces Over the Syndrome Trellis for Synchronization Errors.
CoRR, 2024

Scalable and Reliable Over-the-Air Federated Edge Learning.
CoRR, 2024

Self-Duplicating Random Walks for Resilient Decentralized Learning on Graphs.
CoRR, 2024

An End-to-End Coding Scheme for DNA-Based Data Storage With Nanopore-Sequenced Reads.
CoRR, 2024

Coding for Composite DNA to Correct Substitutions, Strand Losses, and Deletions.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Capacity-Maximizing Input Symbol Selection for Discrete Memoryless Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2024

Correcting a Single Deletion in Reads from a Nanopore Sequencer.
Proceedings of the IEEE International Symposium on Information Theory, 2024

2023
Single-Deletion Single-Substitution Correcting Codes.
IEEE Trans. Inf. Theory, December, 2023

Coding and bounds for partially defective memory cells.
Des. Codes Cryptogr., December, 2023

Function-Correcting Codes.
IEEE Trans. Inf. Theory, September, 2023

Insertion and Deletion Correction in Polymer-Based Data Storage.
IEEE Trans. Inf. Theory, July, 2023

The Noisy Drawing Channel: Reliable Data Storage in DNA Sequences.
IEEE Trans. Inf. Theory, May, 2023

Concatenated Codes for Multiple Reads of a DNA Sequence.
IEEE Trans. Inf. Theory, February, 2023

Information- and Coding-Theoretic Analysis of the RLWE/MLWE Channel.
IEEE Trans. Inf. Forensics Secur., 2023

FuLeeca: A Lee-based Signature Scheme.
IACR Cryptol. ePrint Arch., 2023

Zero Knowledge Protocols and Signatures from the Restricted Syndrome Decoding Problem.
IACR Cryptol. ePrint Arch., 2023

Balancing Privacy and Security in Federated Learning with FedGT: A Group Testing Framework.
CoRR, 2023

Geometrical Properties of Balls in Sum-Rank Metric.
CoRR, 2023

Bounds on Mixed Codes with Finite Alphabets.
Proceedings of the IEEE Information Theory Workshop, 2023

Index-Based Concatenated Codes for the Multi-Draw DNA Storage Channel.
Proceedings of the IEEE Information Theory Workshop, 2023

Secure Over-the-Air Computation Using Zero-Forced Artificial Noise.
Proceedings of the IEEE Information Theory Workshop, 2023

Linearized Reed-Solomon Codes with Support-Constrained Generator Matrix.
Proceedings of the IEEE Information Theory Workshop, 2023

Generic Decoding in the Cover Metric.
Proceedings of the IEEE Information Theory Workshop, 2023

Randomized Decoding of Linearized Reed-Solomon Codes Beyond the Unique Decoding Radius.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Sparse and Private Distributed Matrix Multiplication with Straggler Tolerance.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Private Aggregation in Wireless Federated Learning with Heterogeneous Clusters.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Maximal-Capacity Discrete Memoryless Channel Identification.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Generic Decoding of Restricted Errors.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Codes Correcting Burst and Arbitrary Erasures for Reliable and Low-Latency Communication.
Proceedings of the IEEE International Conference on Acoustics, 2023

An Analysis of the RankSign Signature Scheme with Rank Multipliers.
Proceedings of the Code-Based Cryptography - 11th International Workshop, 2023

2022
Multiple Criss-Cross Insertion and Deletion Correcting Codes.
IEEE Trans. Inf. Theory, 2022

Clustering-Correcting Codes.
IEEE Trans. Inf. Theory, 2022

Adaptive Private Distributed Matrix Multiplication.
IEEE Trans. Inf. Theory, 2022

Secure Private and Adaptive Matrix Multiplication Beyond the Singleton Bound.
IEEE J. Sel. Areas Inf. Theory, 2022

A Power Side-Channel Attack on the Reed-Muller Reed-Solomon Version of the HQC Cryptosystem.
IACR Cryptol. ePrint Arch., 2022

Key-Recovery Fault Injection Attack on the Classic McEliece KEM.
IACR Cryptol. ePrint Arch., 2022

Rank-Metric Codes and Their Applications.
Found. Trends Commun. Inf. Theory, 2022

Sum-rank product codes and bounds on the minimum distance.
Finite Fields Their Appl., 2022

Nested Gradient Codes for Straggler Mitigation in Distributed Machine Learning.
CoRR, 2022

Interleaved Prange: A New Generic Decoder for Interleaved Codes.
Proceedings of the Post-Quantum Cryptography - 13th International Workshop, 2022

Sequential Decoding of Convolutional Codes for Synchronization Errors.
Proceedings of the IEEE Information Theory Workshop, 2022

Distributed Matrix-Vector Multiplication with Sparsity and Privacy Guarantees.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Computational Code-Based Privacy in Coded Federated Learning.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Equivalence of Insertion/Deletion Correcting Codes for d-dimensional Arrays.
Proceedings of the IEEE International Symposium on Information Theory, 2022

List Decoding of 2-Interleaved Binary Alternant Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Efficient Distributed Machine Learning via Combinatorial Multi-Armed Bandits.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Covering Properties of Sum-Rank Metric Codes.
Proceedings of the 58th Annual Allerton Conference on Communication, 2022

2021
On the Gap Between Scalar and Vector Solutions of Generalized Combination Networks.
IEEE Trans. Inf. Theory, 2021

Partial MDS Codes With Regeneration.
IEEE Trans. Inf. Theory, 2021

Error Decoding of Locally Repairable and Partial MDS Codes.
IEEE Trans. Inf. Theory, 2021

Decoding of Interleaved Alternant Codes.
IEEE Trans. Inf. Theory, 2021

Criss-Cross Insertion and Deletion Correcting Codes.
IEEE Trans. Inf. Theory, 2021

Secure Codes With Accessibility for Distributed Storage.
IEEE Trans. Inf. Forensics Secur., 2021

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

Almost affinely disjoint subspaces.
Finite Fields Their Appl., 2021

LIGA: a cryptosystem based on the hardness of rank-metric list and interleaved decoding.
Des. Codes Cryptogr., 2021

Analysis of Communication Channels Related to Physical Unclonable Functions.
CoRR, 2021

Quadratic-Curve-Lifted Reed-Solomon Codes.
CoRR, 2021

On the Capacity of DNA-based Data Storage under Substitution Errors.
Proceedings of the International Conference on Visual Communications and Image Processing, 2021

On transform-domain decoding of generalized Gabidulin codes : Dedicated to the memory of Ernst M. Gabidulin (1937-2021).
Proceedings of the XVII International Symposium "Problems of Redundancy in Information and Control Systems", 2021

Multiple Criss-Cross Deletion-Correcting Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Decoding High-Order Interleaved Rank-Metric Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Efficient Decoding of Gabidulin Codes over Galois Rings.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Decoding of (Interleaved) Generalized Goppa Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Decoding of Space-Symmetric Rank Errors.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Correctable Erasure Patterns in Product Topologies.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
Coding Over Sets for DNA Storage.
IEEE Trans. Inf. Theory, 2020

Private Streaming With Convolutional Codes.
IEEE Trans. Inf. Theory, 2020

Network-Coding Solutions for Minimal Combination Networks and Their Sub-Networks.
IEEE Trans. Inf. Theory, 2020

Private Information Retrieval Over Random Linear Networks.
IEEE Trans. Inf. Forensics Secur., 2020

A Power Side-Channel Attack on the CCA2-Secure HQC KEM.
IACR Cryptol. ePrint Arch., 2020

Rateless Codes for Private Distributed Matrix-Matrix Multiplication.
CoRR, 2020

Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius.
Proceedings of the Post-Quantum Cryptography - 11th International Conference, 2020

Higher Rates and Information-Theoretic Analysis for the RLWE Channel.
Proceedings of the IEEE Information Theory Workshop, 2020

Concatenated Codes for Recovery From Multiple Reads of DNA Sequences.
Proceedings of the IEEE Information Theory Workshop, 2020

Success Probability of Decoding Interleaved Alternant Codes.
Proceedings of the IEEE Information Theory Workshop, 2020

Fountain Codes for Private Distributed Matrix-Matrix Multiplication.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Criss-Cross Deletion Correcting Codes.
Proceedings of the International Symposium on Information Theory and Its Applications, 2020

Low-Rank Parity-Check Codes over the Ring of Integers Modulo a Prime Power.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Coding for Efficient DNA Synthesis.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Partial MDS Codes with Local Regeneration.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Computational Code-Based Single-Server Private Information Retrieval.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Achieving the Capacity of the DNA Storage Channel.
Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

Secrecy and Accessibility in Distributed Storage.
Proceedings of the IEEE Global Communications Conference, 2020

On Software Implementation of Gabidulin Decoders.
Proceedings of the Algebraic and Combinatorial Coding Theory, 2020

Bounds and Code Constructions for Partially Defect Memory Cells.
Proceedings of the Algebraic and Combinatorial Coding Theory, 2020

2019
Variable-Length Bit Mapping and Error-Correcting Codes for Higher-Order Alphabet PUFs - Extended Version.
J. Hardw. Syst. Secur., 2019

Duplication-correcting codes.
Des. Codes Cryptogr., 2019

Improved decoding and error floor analysis of staircase codes.
Des. Codes Cryptogr., 2019

Interleaving Loidreau's Rank-Metric Cryptosystem.
Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

Error Correction for Partially Stuck Memory Cells.
Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

An Upper Bound on the Capacity of the DNA Storage Channel.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Anchor-Based Correction of Substitutions in Indexed Sets.
Proceedings of the IEEE International Symposium on Information Theory, 2019

On Decoding and Applications of Interleaved Goppa Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Network Coding Solutions for the Combination Network and its Subgraphs.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
List Decoding of Insertions and Deletions.
IEEE Trans. Inf. Theory, 2018

Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding.
IEEE Trans. Inf. Theory, 2018

Fast operations on linearized polynomials and their applications in coding theory.
J. Symb. Comput., 2018

On a Rank-Metric Code-Based Cryptosystem with Small Key Size.
IACR Cryptol. ePrint Arch., 2018

Algebraic Coding Theory for Networks, Storage, and Security (Dagstuhl Seminar 18511).
Dagstuhl Reports, 2018

Cyclic Codes with Locality and Availability.
CoRR, 2018

Private Information Retrieval over Networks.
CoRR, 2018

A Public-Key Cryptosystem from Interleaved Goppa Codes.
CoRR, 2018

Bounds and Constructions for Multi-Symbol Duplication Error Correcting Codes.
CoRR, 2018

Twisted Gabidulin Codes in the GPT Cryptosystem.
CoRR, 2018

Locality in Crisscross Error Correction.
CoRR, 2018

Efficient decoding of interleaved subspace and Gabidulin codes beyond their unique decoding radius using Gröbner bases.
Adv. Math. Commun., 2018

Repairing the Faure-Loidreau Public-Key Cryptosystem.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

List Decoding of Locally Repairable Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
List Decoding of Crisscross Errors.
IEEE Trans. Inf. Theory, 2017

Codes Correcting a Burst of Deletions or Insertions.
IEEE Trans. Inf. Theory, 2017

A Correction to "Some Gabidulin Codes Cannot be List Decoded Efficiently at any Radius".
IEEE Trans. Inf. Theory, 2017

Variable-Length Bit Mapping and Error-Correcting Codes for Higher-Order Alphabet PUFs.
IACR Cryptol. ePrint Arch., 2017

Bounds on Codes Correcting Tandem and Palindromic Duplications.
CoRR, 2017

Limits to list decoding of insertions and deletions.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Interleaved subspace codes in fountain mode.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Codes for Partially Stuck-At Memory Cells.
IEEE Trans. Inf. Theory, 2016

Some Gabidulin Codes Cannot Be List Decoded Efficiently at any Radius.
IEEE Trans. Inf. Theory, 2016

Optimal Ferrers Diagram Rank-Metric Codes.
IEEE Trans. Inf. Theory, 2016

Timing Attack Resilient Decoding Algorithms for Physical Unclonable Functions.
CoRR, 2016

Improved erasure list decoding locally repairable codes using alphabet-dependent list recovery.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Sub-quadratic decoding of Gabidulin codes.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Convolutional Codes in Rank Metric With Application to Random Network Coding.
IEEE Trans. Inf. Theory, 2015

Masking trapped charge in flash memories.
Proceedings of the 53rd Annual Allerton Conference on Communication, 2015

2014
Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability.
Des. Codes Cryptogr., 2014

List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques.
Des. Codes Cryptogr., 2014

Optimal Ferrers Diagram Rank-Metric Codes.
CoRR, 2014

List decoding of crisscross error patterns.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Efficient interpolation-based decoding of interleaved subspace and Gabidulin codes.
Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013
Decoding of block and convolutional codes in rank metric.
PhD thesis, 2013

Bounds on List Decoding of Rank-Metric Codes.
IEEE Trans. Inf. Theory, 2013

Fast decoding of Gabidulin codes.
Des. Codes Cryptogr., 2013

Generalizing bounds on the minimum distance of cyclic codes using cyclic product codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Bounds on polynomial-time list decoding of rank metric codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Decoding Cyclic Codes up to a New Bound on the Minimum Distance.
IEEE Trans. Inf. Theory, 2012

Bounds on List Decoding Gabidulin Codes
CoRR, 2012

Rank metric convolutional codes for Random Linear Network Coding.
Proceedings of the International Symposium on Network Coding, 2012

Efficient decoding of Partial Unit Memory codes of arbitrary rate.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
On (Partial) unit memory codes based on Gabidulin codes.
Probl. Inf. Transm., 2011

Fast multi-sequence shift-register synthesis with the Euclidean algorithm.
Adv. Math. Commun., 2011

Efficient decoding of some classes of binary cyclic codes beyond the Hartmann-Tzeng bound.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010
A basis for all solutions of the key equation for Gabidulin codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010


  Loading...