Picture of Antonia Wachter-Zeh

Prof. Dr.-Ing. Antonia Wachter-Zeh

Technical University of Munich

Assistant Professorship of Coding for Communications and Data Storage (Prof. Wachter-Zeh)

Postal address

Postal:
Theresienstr. 90
80333 München

Biography

Since October 2016, I am a Rudolf Mößbauer Tenure Track Assistant Professor at the Technical University of Munich (TUM) and a Fellow at the TUM Institute for Advanced Study (TUM IAS). I am heading the "Coding for Communications and Data Storage" (COD) group.

From November 2013 to August 2016, I was a Postdoctoral Researcher at the Computer Science Department of the Technion---Israel Institute of Technology in the group of Tuvi Etzion, Ronny Roth, and Eitan Yaakobi.

From October 2009 to October 2013, I was a PhD student and teaching assistant under the co-supervision of Martin Bossert at the Institute of Communications Engineering, Ulm University, Germany, and Pierre Loidreau at the Institut de Recherche Mathématique de Rennes (IRMAR), Université de Rennes 1, Rennes, France. You can download my PhD thesis "Decoding of Block and Convolutional Codes in Rank Metric" here.

My main research interests are coding theory, efficient algorithms, security (in particular code-based cryptography and physical unclonable functions), and applying error-correcting codes to communications and storage in general, in particular to network coding, non-volatile memories, distributed data storage, and DNA storage.

Selected Grants and Awards

(Co-)Organized Workshops

Teaching

Lectures

Supervision of PhD Students

Research Topics

Network Coding

The principle of network coding has been attracting growing attention in the recent years as a technique to disseminate information in data networks. The reason for this interest is that network coding achieves higher throughput than routing. In routing, the packets are simply forwarded at each node of the network, whereas in network coding, the nodes perform linear combinations of all packets received so far. Fundamental questions in the area of network coding include assigning appropriate linear combinations to the nodes and choosing a suitable error-correcting code for the case when erroneous packets occur or packets are lost.

List Decoding

List decoding is a major technique for increasing the error correcting capability of codes. The basic idea of list decoding is to return not only a unique decoding result (which is only possible up to half the minimum distance of the corresponding code), but to return all codewords in a certain radius around the received word. This enables us to decode more errors at the cost of a usually small list. Practically, list decoding is used in concatenated coding schemes. Apart from explicit list decoding algorithms, a fundamental question is whether list decoding in a certain metric up to a certain radius can be done in polynomial time.

Coding for Insertions and Deletions and DNA Storage

The Levenshtein distance, also known as the edit distance, is a measure of similarity between two strings evaluated based on the minimum number of insertion/deletion operations required to transform one string into the other. Codes for correcting insertions and deletions were first proposed for communication applications in the presence of synchronization errors. However, insertions, deletions, and duplications have particular importance also for numerous applications in bioinformatics such as DNA storage.

Coding for Storage

Data storage media like flash memories (used in USB flash drives or solid state drives) suffer from manufacturing imperfections, wearout, and fluctuating read/write errors. In distributed data storage (necessary for cloud storage systems), the most common problem are failures of servers and the task is to reconstruct the lost data efficiently. It is therefore necessary to design coding solutions tailored to these storage applications.

Code-based Cryptography

The realistic threat of a quantum supercomputer has motivated research on post-quantum cryptography. Assuming an attack of a sufficiently large quantum computer, several classical public-key algorithms as RSA become insecure since computationally intensive mathematical problems become easy-to-solve. It is therefore necessary to design techniques which are secure against an attack of a quantum computer. One approach to achieve this security is code-based cryptography, where encryption and decryption is based on encoding and decoding an algebraic code. The COD group investigates and improves post-quantum cryptographic systems.

Fast Algorithms

Fast or efficient algorithms for performing certain polynomial and matrix operations are important in several applications, including coding theory.

Physical Unclonable Functions

A Physical Unclonable Function (PUF) is a digital circuit that possesses an intrinsic randomness resulting from process variations. This randomness is exploited to generate random keys for cryptographic applications which can be reproduced on demand. Thus, no embedded physically secure non-volatile memory is needed. However, the regeneration of a key is not perfect due to environmental factors such as temperature variations and aging effects of the digital circuit. These variations can be seen as an erroneous channel and therefore error-correcting codes increase the reliability of key regenerations.

Coding for Communications

In communications, error-correcting codes are an indispensable means to cope with errors which happen during the transmission.

Reed-Solomon and Cyclic Codes

Convolutional Codes

Publications

2018

  • Bartz, H.; Wachter-Zeh, A.: Efficient Decoding of Interleaved Subspace and Gabidulin Codes beyond their Unique Decoding Radius Using Gröbner Bases. Advances in Mathematics of Communications, 2018 mehr… Volltext ( DOI )
  • Etzion, T.; Wachter-Zeh, A.: Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding. IEEE Trans. Inform. Theory, 2018 mehr… Volltext ( DOI )
  • Hedongliang Liu, Lukas Holzbaur, Antonia Wachter-Zeh: Locality in Crisscross Error Correction. Munich Doctoral Seminar on Communications 2018, 2018 mehr…
  • Holzbaur, L.; Bartz, H.; Wachter-Zeh, A.: Improved Decoding and Error Floor Analysis of Staircase Codes. Designs, Codes and Cryptography, 2018 mehr…
  • Holzbaur, L.; Freij-Hollanti, R.; Wachter-Zeh, A.; Hollanti, C.: Private Streaming with Convolutional Codes. IEEE Information Theory Workshop (ITW) 2018, 2018 mehr…
  • Holzbaur, L.; Lenz, A.; Wachter-Zeh, A.: Coding for Reliable Data Storage. TUM-IAS General Assembly, 2018 mehr…
  • Holzbaur, L.; Wachter-Zeh, A.: List Decoding of Locally Repairable Codes. Munich Workshop on Coding and Cryptography 2018, 2018 mehr…
  • Holzbaur, L.; Wachter-Zeh, A.: List Decoding of Locally Repairable Codes. IEEE Int. Symp. Inform. Theory (ISIT), 2018 mehr…
  • Immler, V.; Hiller, M.; Qinzhi, L.; Lenz, A.; Wachter-Zeh, A.: Variable-Length Bit Mapping and Error- Correcting Codes for Higher-Order Alphabet PUFs. Journal of Hardware and Systems Security, 2018 mehr…
  • Lenz, A.; Jünger, N., Wachter-Zeh, A.: Correcting Duplications of Multiple Consecutive Symbols. Workshop on Coding, Cooperation, and Security in Modern Communication Networks (COCO), 2018 mehr…
  • Lenz, A.; Jünger, N., Wachter-Zeh, A.: Bounds and Constructions for Multi-Symbol Duplication Error Correcting Codes. 16th International Workshop on Algebraic and Combinatorial Coding Theory (ACCT), 2018 mehr…
  • Lenz, A.; Siegel, P.; Wachter-Zeh, A.; Yaakobi, E.: Coding over Sets for DNA Storage. Munich Workshop on Coding and Cryptography (MWCC), 2018 mehr…
  • Lenz, A.; Siegel, P.; Wachter-Zeh, A.; Yaakobi, E.: Constructions and Bounds for Reliable Data Storage in Unordered DNA Sequences. TUM CoC COM PhD Workshop 2018: Ultra Reliable Low Latency Communications and Applications for 5G, 2018 mehr…
  • Lenz, A.; Siegel, P.; Wachter-Zeh, A.; Yaakobi, E.: Coding over Sets for DNA Storage. IEEE Int. Symp. Inform. Theory (ISIT), 2018 mehr…
  • Lenz, A.; Siegel, P.; Wachter-Zeh, A.; Yaakobi, E.: Correcting Errors in Sets of Distorted DNA Sequences. DLR/TUM/UUlm Workshop on Coding and Cryptography, 2018 mehr…
  • Lenz, A.; Wachter-Zeh, A.; Yaakobi, E.: Duplication-Correcting Codes. Designs, Codes, and Cryptography, 2018 mehr… Volltext ( DOI )
  • Liu, L.; Holzbaur, L.; Wachter-Zeh, A.: Locality in Crisscross Error Correction. Sixteenth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT), 2018 mehr…
  • Puchinger, S.; Renner, J.; Wachter-Zeh, A.: Twisted Gabidulin Codes in the GPT Cryptosystem. Sixteenth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT), 2018 mehr…
  • Wachter-Zeh, A.: List Decoding of Insertions and Deletions. IEEE Trans. Inform. Theory, 2018 mehr… Volltext ( DOI )
  • Wachter-Zeh, A.: Challenges of Post-Quantum Cryptography. TUM Institute for Advanced Study General Assembly, 2018 mehr…
  • Wachter-Zeh, A.: On a Rank-Metric Code-Based Cryptosystem with Small Key Size. Munich Workshop on Coding and Cryptography 2018, 2018 mehr…
  • Wachter-Zeh, A.: Rank-Metric Codes, Subspace Codes & Network Coding. Winter School on Applied Algebra and Coding Theory, 2018 mehr…
  • Wachter-Zeh, A.; Puchinger, S.; Renner, J.: Repairing the Faure-Loidreau Public-Key Cryptosystem. IEEE Int. Symp. Inform. Theory (ISIT), 2018 mehr…

2017

  • Holzbaur, L.; Bartz, H., Wachter-Zeh, A.: Improved Decoding and Error Floor Analysis of Staircase Codes. Tenth International Workshop on Coding and Cryptography (WCC), 2017 mehr…
  • Immler, V.; Hiller, M.; Liu, Q.; Lenz, A.; Wachter-Zeh, A.: Variable-Length Bit Mapping and Error-Correcting Codes for Higher-Order Alphabet PUFs. TUM-Eurecom Workshop on Communications and Security, 2017 mehr…
  • Immler, V.; Hiller, M.; Liu, Q.; Lenz, A.; Wachter-Zeh, A.: Variable-Length Bit Mapping and Error-Correcting Codes for Higher-Order Alphabet PUFs. Seventh International Conference on Security, Privacy, and Applied Cryptography Engineering (SPACE) 2017, 2017 mehr…
  • Lenz, A.; Wachter-Zeh, A.: Maximum Cardinalities for Tandem and Palindromic Duplication Correcting Codes. 18th Joint Workshop Coding and Communications (JWCC), 2017 mehr…
  • Lenz, A.; Wachter-Zeh, A.; Yaakobi, E.: On Codes Correcting Adjacent Symbol Duplications. Munich Workshop on Coding and Applications (MWCA), 2017 mehr…
  • Lenz, A.; Wachter-Zeh, A.; Yaakobi, E.: Codes for Tandem and Palindromic Duplications Errors. International Symposium on Information Theory (ISIT), 2017 mehr…
  • Lenz, A.; Wachter-Zeh, A.; Yaakobi, E.: Bounds on Codes Correcting Tandem and Palindromic Duplications. 10th International Workshop Coding and Cryptography (WCC), 2017 mehr…
  • Puchinger, S.; Müelich, S.; Wachter-Zeh, A.; Bossert, M.: Timing Attack Resilient Decoding Algorithms for Physical Unclonable Functions. International ITG Conference on Systems, Communications and Coding (SCC), 2017 mehr…
  • Puchinger, S.; Wachter-Zeh, A.: Fast Operations on Linearized Polynomials and their Applications in Coding Theory. (accepted for) Journal of Symbolic Computation, 2017 mehr… Volltext ( DOI )
  • Schoeny, C.; Wachter-Zeh, A.; Gabrys, R.; Yaakobi, E.: Codes Correcting a Burst of Deletions or Insertions. IEEE Trans. Inform. Theory 63 (4), 2017 mehr… Volltext ( DOI )
  • Sidorenko, V., Bartz, H., Wachter-Zeh, A.: Interleaved Subspace Codes in Fountain Mode. Invited talk at Moscow Institute for Physics and Technology , 2017 mehr…
  • Sidorenko, V.; Bartz, H.; Wachter-Zeh, A.: Interleaved Subspace Codes in Fountain Mode. IEEE Int. Symp. Inform. Theory (ISIT), 2017 mehr…
  • Wachter-Zeh, A.: List Decoding of Crisscross Errors. IEEE Trans. Inform. Theory 63 (1), 2017 mehr… Volltext ( DOI )
  • Wachter-Zeh, A.: List Decoding of Insertions and Deletions. (accepted for) IEEE Trans. Inform. Theory, 2017 mehr… Volltext ( DOI )
  • Wachter-Zeh, A.: Limits to List Decoding of Insertions and Deletions. IEEE Int. Symp. Inform. Theory (ISIT), 2017 mehr…
  • Wachter-Zeh, A.: Coding Theory: "Old" Concepts for "New" Applications. TUM IAS Talk, 2017 mehr…
  • Wachter-Zeh, A.: Coding Theory for Storage and Networks. Talk at DLR, 2017 mehr…
  • Wachter-Zeh, A.: Insertion/Deletion Correction for Variable-Length PUF Responses. Munich Workshop on Physical Unclonable Functions (MPUF), 2017 mehr…

2016

  • Bossert, M.; Sidorenko, V.; Wachter-Zeh, A.: Coding Techniques for Transmitting Packets Through Complex Communication Networks. In: Communications in Interference Limited Networks, ser. Signals and Communication Technology. Springer International Publishing, 2016 mehr…
  • Etzion, T.; Gorla, E.; Ravagnani, A.; Wachter-Zeh, A.: Optimal Ferrers Diagram Rank-Metric Codes. IEEE Trans. Inform. Theory 62 (4), 2016, 1616 --1630 mehr… Volltext ( DOI )
  • Etzion, T.; Wachter-Zeh, A.: Vector network coding based on subspace codes outperforms scalar linear network coding. IEEE Int. Symp. Inf. Theory (ISIT), 2016 mehr…
  • Holzbaur, L.; Bartz, H., Wachter-Zeh, A.: Improved Decoding of Staircase Codes. MIO 2016, 2016 mehr…
  • Puchinger, S.; Wachter-Zeh, A.: Sub-quadratic decoding of Gabidulin codes. IEEE Int. Symp. Inf. Theory (ISIT), 2016 mehr…
  • Raviv, N.; Wachter-Zeh, A.: Some Gabidulin Codes Cannot be List Decoded Efficiently at any Radius. IEEE Trans. Inform. Theory 62 (4), 2016, 1605--1615 mehr… Volltext ( DOI )
  • Schoeny, C.; Wachter-Zeh, A.; Gabrys, R.; Yaakobi, E.: Codes correcting a burst of deletions or insertions. IEEE Int. Symp. Inf. Theory (ISIT), 2016 mehr…
  • Wachter-Zeh, A.; Yaakobi, E.: Codes for Partially Stuck-at Memory Cells. IEEE Trans. Inform. Theory 62 (2), 2016, 639--654 mehr… Volltext ( DOI )
  • Zeh, A.; Wachter-Zeh, A.: Improved erasure list decoding locally repairable codes using alphabet-dependent list recovery. IEEE Int. Symp. Inf. Theory (ISIT), 2016 mehr…

2015

  • Raviv, N.; Wachter-Zeh, A.: Some Gabidulin Codes Cannot be List Decoded Efficiently at any Radius. IEEE Int. Symp. Inf. Theory (ISIT), 2015 mehr…
  • Wachter-Zeh, A.: Codes for Partially Stuck-at Memory Cells. Invited Talk at SanDisk Israel, Kfar Saba, Israel, 2015 mehr…
  • Wachter-Zeh, A.; Stinner, M.; Sidorenko, V.: Convolutional Codes in Rank Metric with Application to Random Network Coding. IEEE Trans. Inform. Theory 61 (6), 2015, 3199--3213 mehr…
  • Wachter-Zeh, A.; Yaakobi, E.: Codes for Partially Stuck-at Memory Cells. Int. ITG Conf. on Systems, Communications and Coding (SCC), 2015 mehr…
  • Wachter-Zeh, A.; Yaakobi, E.: Masking Trapped Charge in Flash Memories. 53nd Annual Allerton Conference on Communication, Control, and Computing, 2015 mehr…
  • Wachter-Zeh, A.; Yaakobi, E.: Codes for Partially Stuck-at Memory Cells. Workshop on Coding for Emerging Memories and Storage Technologies, 2015 mehr…

2014

  • Bartz, H.; Wachter-Zeh, A.: Efficient Interpolation-Based Decoding of Interleaved Subspace and Gabidulin Codes. 52nd Annual Allerton Conference on Communication, Control, and Computing, 2014 mehr…
  • Puchinger, S.; Wachter-Zeh, A.; Bossert, M.: Improved Decoding of Partial Unit Memory Codes Using List Decoding of Reed--Solomon Codes. Int. Zurich Seminar on Communications, 2014 mehr…
  • Wachter-Zeh, A.: List Decoding of Crisscross Error Patterns. IEEE Int. Symp. Inf. Theory (ISIT), 2014 mehr…
  • Wachter-Zeh, A.: List Decoding of Crisscross Error Patterns. Invited Talk at Ulm University, 2014 mehr…
  • Wachter-Zeh, A.: List Decoding of Crisscross Errors. Invited Talk at TU Dresden, 2014 mehr…
  • Wachter-Zeh, A.; Etzion, T.: Ferrers Diagram Rank-Metric Codes. Conference Algebra, Codes, and Networks, 2014 mehr…
  • Wachter-Zeh, A.; Zeh, A.: List and Unique Error-Erasure Decoding of Interleaved Gabidulin Codes with Interpolation Techniques. Des. Codes Cryptogr. 73 (2), 2014, 547--570 mehr…
  • Wachter-Zeh, A.; Zeh, A.; Bossert, M.: Decoding Interleaved Reed--Solomon Codes beyond their Joint Error-Correcting Capability. Des. Codes Cryptogr. 71 (2), 2014, 261--281 mehr… Volltext ( DOI )

2013

  • Wachter-Zeh, A.: Bounds on List Decoding of Rank-Metric Codes. IEEE Trans. Inform. Theory 59 (11), 2013, 7268--7277 mehr…
  • Wachter-Zeh, A.: Bounds on Polynomial-Time List Decoding of Rank Metric Codes. IEEE Int. Symp. Inf. Theory (ISIT), 2013 mehr…
  • Wachter-Zeh, A.: Bounds on List Decoding Rank-Metric Codes. Conference on Random Network codes and Designs over GF(q), 2013 mehr…
  • Wachter-Zeh, A.; Afanassiev, V.; Sidorenko, V.: Fast Decoding of Gabidulin Codes. Des. Codes Cryptogr. 66 (1), 2013, 57-73 mehr…
  • Wachter-Zeh, A.; Zeh, A.: Interpolation-Based Decoding of Interleaved Gabidulin Codes. Int. Workshop Coding Cryptogr. (WCC), 2013 mehr…
  • Zeh, A.; Wachter-Zeh, A.; Gadouleau, M.; Bezzateev, S.: Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes. IEEE Int. Symp. Inf. Theory (ISIT), 2013 mehr…

2012

  • Sidorenko, V.; Wachter-Zeh, A.; Chen, D.: On Fast Decoding of Interleaved Gabidulin Codes. Int. Symp. Probl. Redundancy Inf. Control Systems, 2012 mehr…
  • Wachter-Zeh, A.: Bounds on List Decoding of Rank-Metric Codes. Invited Talk at the Institute for Information Transmission Problems (IITP), 2012 mehr…
  • Wachter-Zeh, A.: Bounds on List Decoding Gabidulin Codes. Int. Workshop Alg. Combin. Coding Theory (ACCT), 2012 mehr…
  • Wachter-Zeh, A.; Sidorenko, V.: Rank Metric Convolutional Codes for Random Linear Network Codingde Rank Metric Convolutional Codes for Random Linear Network Coding. IEEE Int. Symp. Network Coding (Netcod), 2012 mehr…
  • Wachter-Zeh, A.; Stinner, M.; Bossert, M.: Efficient Decoding of Partial Unit Memory Codes of Arbitrary Ratede Efficient Decoding of Partial Unit Memory Codes of Arbitrary Rate. IEEE Int. Symp. Inf. Theory (ISIT), 2012 mehr…
  • Zeh, A.; Wachter-Zeh, A.; Bezzateev, S.: Decoding Cyclic Codes up to a New Bound on the Minimum Distance. IEEE Trans. Inform. Theory 58 (6), 2012, 3951--3960 mehr…
  • Zeh, A.; Wachter-Zeh, A.; Bossert, M.: Unambiguous {D}ecoding of {G}eneralized {R}eed-{S}olomon {C}odes beyond {H}alf the {M}inimum {D}istancede Unambiguous Decoding of Generalized Reed-Solomon Codes beyond Half the Minimum Distance. Int. Zurich Seminar on Communications, 2012 mehr…

2011

  • Wachter, A.; Afanassiev, V.; Sidorenko, V.: Fast Decoding of Gabidulin Codes. Int. Workshop Coding Cryptogr. (WCC), 2011 mehr…
  • Wachter, A.; Sidorenko, V.; Bossert, M.; Zyablov, V.: Partial Unit Memory Codes Based on Gabidulin Codes. IEEE Int. Symp. Inf. Theory (ISIT), 2011 mehr…
  • Wachter, A.; Sidorenko, V.; Bossert, M.; Zyablov, V.: On (Partial) Unit Memory Codes Based on Gabidulin Codes. Probl. Inf. Transm. 47 (2), 2011, 38--51 mehr…
  • Zeh, A.; Wachter, A.: Fast Multi-Sequence Shift-Register Synthesis with the Euclidean Algorithm. Adv. Math. Commun. 5 (4), 2011, 667--680 mehr…
  • Zeh, A.; Wachter, A.; Bezzateev, S.: Efficient Decoding of Some Classes of Binary Cyclic Codes beyond the Hartmann--Tzeng Boundde Efficient Decoding of Some Classes of Binary Cyclic Codes Beyond the Hartmann-Tzeng Bound. IEEE Int. Symp. Inf. Theory (ISIT), 2011 mehr…

2010

  • Kampf, S.; Wachter, A.; Bossert, M.: A Method for Soft-Decision Decoding of Reed-Solomon Codes Based on the Extended Euclidean Algorithmde Unambiguous Decoding of Generalized Reed-Solomon Codes beyond Half the Minimum Distance. ITG Conf. Source Channel Coding (SCC), 2010 mehr…
  • Wachter, A.; Sidorenko, V.; Bossert, M.: A Basis for all Solutions of the Key Equation for Gabidulin Codesde A Basis for all Solutions of the Key Equation for Gabidulin Codes. IEEE Int. Symp. Inf. Theory (ISIT), 2010 mehr…
  • Wachter, A.; Sidorenko, V.; Bossert, M.: A Fast Linearized Euclidean Algorithm for Decoding Gabidulin Codesde A Fast Linearized Euclidean Algorithm for Decoding Gabidulin Codes. Int. Workshop Alg. Combin. Coding Theory (ACCT), 2010 mehr…