Alexander Zeh

Orcid: 0000-0002-5044-4940

According to our database1, Alexander Zeh authored at least 34 papers between 2008 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Enabling Secure Communication for Automotive Endpoint-ECUs through Lightweight-Cryptography.
Proceedings of the 7th ACM Computer Science in Cars Symposium, 2023

2021
Exploring the RISC-V Vector Extension for the Classic McEliece Post-Quantum Cryptosystem.
Proceedings of the 22nd International Symposium on Quality Electronic Design, 2021

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

2019
On Spectral Design Methods for Quasi-Cyclic Codes.
IEEE Trans. Inf. Theory, 2019

CCM-SIV: Single-PRF Nonce-Misuse-Resistant Authenticated Encryption.
IACR Cryptol. ePrint Arch., 2019

Parity-Based Concurrent Error Detection Schemes for the ChaCha Stream Cipher.
CoRR, 2019

Parity-Based Concurrent Error Detection Schemes for the ChaCha Stream Cipher.
Proceedings of the 2019 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems, 2019

2018
Anticode-based locally repairable codes with high availability.
Des. Codes Cryptogr., 2018

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

2017
Long Cyclic Codes Over GF(4) and GF(8) Better Than BCH Codes in the High-Rate Region.
IEEE Trans. Inf. Theory, 2017

2016
Spectral Analysis of Quasi-Cyclic Product Codes.
IEEE Trans. Inf. Theory, 2016

Bounds and constructions of codes with multiple localities.
Proceedings of the IEEE International Symposium on Information Theory, 2016

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

2015
Decoding of repeated-root cyclic codes up to new bounds on their minimum distance.
Probl. Inf. Transm., 2015

Construction of Quasi-Cyclic Product Codes.
CoRR, 2015

Optimal linear and cyclic locally repairable codes over small fields.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Improved burst error correction via list decoding quasi-cyclic codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Optimal binary locally repairable codes via anticodes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes.
Des. Codes Cryptogr., 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

Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes.
Des. Codes Cryptogr., 2014

Decoding of quasi-cyclic codes up to a new lower bound on the minimum distance.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Algebraic soft- and hard-decision decoding of generalized reed-solomon and cyclic codes.
PhD thesis, 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

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

Describing a cyclic code by another cyclic code.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
An Interpolation Procedure for List Decoding Reed-Solomon Codes Based on Generalized Key Equations.
IEEE Trans. Inf. Theory, 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
Decoding Reed-Solomon codes up to the Sudan radius with the Euclidean algorithm.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

A link between Guruswami-Sudan's list-decoding and decoding of interleaved Reed-Solomon codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010

End-to-End algebraic network coding for wireless TCP/IP networks.
Proceedings of the 17th International Conference on Telecommunications, 2010

2008
On the Roth and Ruckenstein equations for the Guruswami-Sudan algorithm.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008


  Loading...