default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexander Zeh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c20]Friedrich Wiemer
, Alexander Zeh:
Enabling Secure Communication for Automotive Endpoint-ECUs through Lightweight-Cryptography. CSCS 2023: 9:1-9:10- 2021
- [c19]Hedongliang Liu, Sabine Pircher, Alexander Zeh, Antonia Wachter-Zeh:
Decoding of (Interleaved) Generalized Goppa Codes. ISIT 2021: 664-669 - [c18]Sabine Pircher, Johannes Geier, Alexander Zeh, Daniel Mueller-Gritschneder:
Exploring the RISC-V Vector Extension for the Classic McEliece Post-Quantum Cryptosystem. ISQED 2021: 401-407 - [i21]Hedongliang Liu, Sabine Pircher, Alexander Zeh, Antonia Wachter-Zeh:
Decoding of (Interleaved) Generalized Goppa Codes. CoRR abs/2102.02831 (2021)
2010 – 2019
- 2019
- [j12]Ron M. Roth, Alexander Zeh:
On Spectral Design Methods for Quasi-Cyclic Codes. IEEE Trans. Inf. Theory 65(5): 2637-2647 (2019) - [c17]Alexander Zeh, Manuela Meier, Viola Rieger:
Parity-Based Concurrent Error Detection Schemes for the ChaCha Stream Cipher. DFT 2019: 1-4 - [i20]Viola Rieger, Alexander Zeh:
Parity-Based Concurrent Error Detection Schemes for the ChaCha Stream Cipher. CoRR abs/1904.06073 (2019) - [i19]Patrick Kresmer, Alexander Zeh:
CCM-SIV: Single-PRF Nonce-Misuse-Resistant Authenticated Encryption. IACR Cryptol. ePrint Arch. 2019: 892 (2019) - 2018
- [j11]Natalia Silberstein, Alexander Zeh:
Anticode-based locally repairable codes with high availability. Des. Codes Cryptogr. 86(2): 419-445 (2018) - [i18]Molka Elleuch, Antonia Wachter-Zeh, Alexander Zeh:
A Public-Key Cryptosystem from Interleaved Goppa Codes. CoRR abs/1809.03024 (2018) - 2017
- [j10]Ron M. Roth, Alexander Zeh:
Long Cyclic Codes Over GF(4) and GF(8) Better Than BCH Codes in the High-Rate Region. IEEE Trans. Inf. Theory 63(1): 150-158 (2017) - 2016
- [j9]Alexander Zeh, San Ling:
Spectral Analysis of Quasi-Cyclic Product Codes. IEEE Trans. Inf. Theory 62(10): 5359-5374 (2016) - [c16]Alexander Zeh, Eitan Yaakobi:
Bounds and constructions of codes with multiple localities. ISIT 2016: 640-644 - [c15]Ron M. Roth, Alexander Zeh:
Long cyclic codes over GF(4) and GF(8) better than BCH codes in the high-rate region. ISIT 2016: 1103-1107 - [c14]Ron M. Roth, Alexander Zeh:
On spectral design methods for quasi-cyclic codes. ISIT 2016: 1108-1112 - [c13]Alexander Zeh, San Ling:
Spectral analysis of quasi-cyclic product codes. ISIT 2016: 1113-1117 - [c12]Alexander Zeh, Antonia Wachter-Zeh:
Improved erasure list decoding locally repairable codes using alphabet-dependent list recovery. ISIT 2016: 1581-1585 - [i17]Alexander Zeh, Eitan Yaakobi:
Bounds and Constructions of Codes with Multiple Localities. CoRR abs/1601.02763 (2016) - 2015
- [j8]Alexander Zeh, Markus Ulmschneider:
Decoding of repeated-root cyclic codes up to new bounds on their minimum distance. Probl. Inf. Transm. 51(3): 217-230 (2015) - [c11]Alexander Zeh, Ron M. Roth:
Improved burst error correction via list decoding quasi-cyclic codes. ISIT 2015: 16-20 - [c10]Natalia Silberstein, Alexander Zeh:
Optimal binary locally repairable codes via anticodes. ISIT 2015: 1247-1251 - [c9]Alexander Zeh, Eitan Yaakobi:
Optimal linear and cyclic locally repairable codes over small fields. ITW 2015: 1-5 - [i16]Alexander Zeh, San Ling:
Construction of Quasi-Cyclic Product Codes. CoRR abs/1501.06543 (2015) - [i15]Natalia Silberstein, Alexander Zeh:
Optimal Binary Locally Repairable Codes via Anticodes. CoRR abs/1501.07114 (2015) - [i14]Alexander Zeh, Eitan Yaakobi:
Optimal Linear and Cyclic Locally Repairable Codes over Small Fields. CoRR abs/1502.06809 (2015) - [i13]Alexander Zeh, Markus Ulmschneider:
Decoding of Repeated-Root Cyclic Codes up to New Bounds on Their Minimum Distance. CoRR abs/1506.02820 (2015) - [i12]Alexander Zeh, San Ling:
Spectral Analysis of Quasi-Cyclic Product Codes. CoRR abs/1512.06690 (2015) - 2014
- [j7]Alexander Zeh, Sergey Bezzateev:
A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes. Des. Codes Cryptogr. 71(2): 229-246 (2014) - [j6]Antonia Wachter-Zeh, Alexander Zeh, Martin Bossert:
Decoding interleaved Reed-Solomon codes beyond their joint error-correcting capability. Des. Codes Cryptogr. 71(2): 261-281 (2014) - [j5]Johan Sebastian Rosenkilde Nielsen, Alexander Zeh:
Multi-trial Guruswami-Sudan decoding for generalised Reed-Solomon codes. Des. Codes Cryptogr. 73(2): 507-527 (2014) - [j4]Antonia Wachter-Zeh, Alexander Zeh:
List and unique error-erasure decoding of interleaved Gabidulin codes with interpolation techniques. Des. Codes Cryptogr. 73(2): 547-570 (2014) - [c8]Alexander Zeh, San Ling:
Decoding of quasi-cyclic codes up to a new lower bound on the minimum distance. ISIT 2014: 2584-2588 - [i11]Alexander Zeh, San Ling:
Decoding of Quasi-Cyclic Codes up to A New Lower Bound on the Minimum Distance. CoRR abs/1404.2819 (2014) - [i10]Johan Sebastian Rosenkilde Nielsen, Alexander Zeh:
Multi-Trial Guruswami-Sudan Decoding for Generalised Reed-Solomon Codes. CoRR abs/1404.3022 (2014) - [i9]Antonia Wachter-Zeh, Alexander Zeh:
List and Unique Error-Erasure Decoding of Interleaved Gabidulin Codes with Interpolation Techniques. CoRR abs/1404.6048 (2014) - 2013
- [b1]Alexander Zeh:
Algebraic soft- and hard-decision decoding of generalized reed-solomon and cyclic codes. University of Ulm, Shaker 2013, ISBN 978-3-8440-2288-9, pp. 1-158 - [c7]Alexander Zeh, Antonia Wachter-Zeh, Maximilien Gadouleau, Sergey Bezzateev:
Generalizing bounds on the minimum distance of cyclic codes using cyclic product codes. ISIT 2013: 126-130 - [i8]Alexander Zeh, Antonia Wachter-Zeh, Maximilien Gadouleau, Sergey Bezzateev:
Generalizing Bounds on the Minimum Distance of Cyclic Codes Using Cyclic Product Codes. CoRR abs/1301.6231 (2013) - [i7]Johan Sebastian Rosenkilde Nielsen, Alexander Zeh:
Multi-Trial Guruswami--Sudan Decoding for Generalised Reed--Solomon Codes. CoRR abs/1301.6236 (2013) - 2012
- [j3]Alexander Zeh, Antonia Wachter-Zeh, Sergey Bezzateev:
Decoding Cyclic Codes up to a New Bound on the Minimum Distance. IEEE Trans. Inf. Theory 58(6): 3951-3960 (2012) - [c6]Alexander Zeh, Sergey Bezzateev:
Describing a cyclic code by another cyclic code. ISIT 2012: 2896-2900 - [i6]Alexander Zeh, Sergey Bezzateev:
Describing A Cyclic Code by Another Cyclic Code. CoRR abs/1204.4563 (2012) - [i5]Alexander Zeh, Sergey Bezzateev:
A New Bound on the Minimum Distance of Cyclic Codes Using Small-Minimum-Distance Cyclic Codes. CoRR abs/1206.4976 (2012) - 2011
- [j2]Alexander Zeh, Antonia Wachter:
Fast multi-sequence shift-register synthesis with the Euclidean algorithm. Adv. Math. Commun. 5(4): 667-680 (2011) - [j1]Alexander Zeh, Christian Gentner, Daniel Augot:
An Interpolation Procedure for List Decoding Reed-Solomon Codes Based on Generalized Key Equations. IEEE Trans. Inf. Theory 57(9): 5946-5959 (2011) - [c5]Alexander Zeh, Antonia Wachter, Sergey Bezzateev:
Efficient decoding of some classes of binary cyclic codes beyond the Hartmann-Tzeng bound. ISIT 2011: 1017-1021 - [i4]Alexander Zeh, Antonia Wachter, Sergey Bezzateev:
Decoding Cyclic Codes up to a New Bound on the Minimum Distance. CoRR abs/1105.1894 (2011) - [i3]Alexander Zeh, Christian Gentner, Daniel Augot:
An Interpolation Procedure for List Decoding Reed--Solomon codes Based on Generalized Key Equations. CoRR abs/1110.3898 (2011) - 2010
- [c4]Christian Senger, Steffen Schober, Tong Mao, Alexander Zeh:
End-to-End algebraic network coding for wireless TCP/IP networks. ICT 2010: 607-612 - [c3]Alexander Zeh, Christian Senger:
A link between Guruswami-Sudan's list-decoding and decoding of interleaved Reed-Solomon codes. ISIT 2010: 1198-1202 - [c2]Alexander Zeh, Wenhui Li:
Decoding Reed-Solomon codes up to the Sudan radius with the Euclidean algorithm. ISITA 2010: 986-990 - [i2]Alexander Zeh, Christian Senger:
A Link between Guruswami--Sudan's List--Decoding and Decoding of Interleaved Reed--Solomon Codes. CoRR abs/1006.1658 (2010)
2000 – 2009
- 2009
- [i1]Christian Senger, Steffen Schober, Tong Mao, Alexander Zeh:
End-to-End Algebraic Network Coding for Wireless TCP/IP Networks. CoRR abs/0911.5667 (2009) - 2008
- [c1]Daniel Augot, Alexander Zeh:
On the Roth and Ruckenstein equations for the Guruswami-Sudan algorithm. ISIT 2008: 2620-2624
Coauthor Index
aka: Antonia Wachter
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-05-08 21:45 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:
