Antonia Wachter-Zeh

Antonia Wachter-Zeh

Auto-generated profile, based on publicly available information

Antonia Wachter-Zeh

University of Ulm

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 February 2012 in IEEE Transactions on Information Theory
Verified
Journal Article
Closed access
AZAlexander Zeh
Alexander Zeh
AWAntonia Wachter-Zeh
Antonia Wachter-Zeh
Sergey BezzateevSergey Bezzateev
Sergey Bezzateev
A new lower bound on the minimum distance of q-ary cyclic codes is proposed. This bound improves upon the Bose-Chaudhuri-Hocquenghem bound and, for some codes, upon the Hartmann-Tzeng bound. Several Boston bounds are special cases of our bound. For some classes of codes, the bound on the minimum distance is refined. Furthermore, a quadratic-time decoding algorithm up to this new bound is developed. The determination of the error locations is based on the Euclidean algorithm and a modified Chien search. The error evaluation is done by solving a generalization of Forney's formula.

28 March 2014 in Designs, Codes and Cryptography
Verified
Journal Article
Closed access
PDF file
AWAntonia Wachter-Zeh
Antonia Wachter-Zeh
AZAlexander Zeh
Alexander Zeh

24 April 2014 in arXiv
Verified
Preprint
Open access
PDF file
AWAntonia Wachter-Zeh
Antonia Wachter-Zeh
AZAlexander Zeh
Alexander Zeh
A new interpolation-based decoding principle for interleaved Gabidulin codes is presented. The approach consists of two steps: First, a multi-variate linearized polynomial is constructed which interpolates the coefficients of the received word and second, the roots of this polynomial have to be found. Due to the specific structure of the interpolation polynomial, both steps (interpolation and root-finding) can be accomplished by solving a linear system of equations. This decoding principle can be applied as a list decoding algorithm (where the list size is not necessarily bounded polynomially) as well as an efficient probabilistic unique decoding algorithm. For the unique decoder, we show a connection to known unique decoding approaches and give an upper bound on the failure probability. Finally, we generalize our approach to incorporate not only errors, but also row and column erasures.

27 June 2013 in arXiv
Verified
Preprint
Open access
PDF file
AZAlexander Zeh
Alexander Zeh
AWAntonia Wachter-Zeh
Antonia Wachter-Zeh
MGMaximilien Gadouleau
Maximilien Gadouleau
Sergey BezzateevSergey Bezzateev
Sergey Bezzateev
Two generalizations of the Hartmann--Tzeng (HT) bound on the minimum distance of q-ary cyclic codes are proposed. The first one is proven by embedding the given cyclic code into a cyclic product code. Furthermore, we show that unique decoding up to this bound is always possible and outline a quadratic-time syndrome-based error decoding algorithm. The second bound is stronger and the proof is more involved. Our technique of embedding the code into a cyclic product code can be applied to other bounds, too and therefore generalizes them.