Hannes Bartz

Orcid: 0000-0001-7767-1513

Affiliations:
  • Deutsches Zentrum für Luft und Raumfahrt, Oberpfaffenhofen, Germany
  • Technical University Munich, Germany (PhD 2017)


According to our database1, Hannes Bartz authored at least 39 papers between 2010 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Interpolation-based decoding of folded variants of linearized and skew Reed-Solomon codes.
Des. Codes Cryptogr., March, 2024

Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory.
Des. Codes Cryptogr., February, 2024

2023
VDES R-Mode: Vulnerability analysis and mitigation concepts.
Int. J. Satell. Commun. Netw., 2023

Error-Correction Performance of Regular Ring-Linear LDPC Codes over Lee Channels.
CoRR, 2023

Fast Decoding of Lifted Interleaved Linearized Reed-Solomon Codes for Multishot Network Coding.
CoRR, 2023

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

Fast Gao-Like Decoding of Horizontally Interleaved Linearized Reed-Solomon Codes.
Proceedings of the Code-Based Cryptography - 11th International Workshop, 2023

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

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

Fast Kötter-Nielsen-Høholdt Interpolation over Skew Polynomial Rings.
CoRR, 2022

Fast Decoding of Interleaved Linearized Reed-Solomon Codes and Variants.
CoRR, 2022

Error-Erasure Decoding of Linearized Reed-Solomon Codes in the Sum-Rank Metric.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Analysis of Low-Density Parity-Check Codes over Finite Integer Rings for the Lee Channel.
Proceedings of the IEEE Global Communications Conference, 2022

On Decoding High-Order Interleaved Sum-Rank-Metric Codes.
Proceedings of the Code-Based Cryptography - 10th International Workshop, 2022

Distinguishing and Recovering Generalized Linearized Reed-Solomon Codes.
Proceedings of the Code-Based Cryptography - 10th International Workshop, 2022

2021
Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric.
IEEE Trans. Inf. Theory, 2021

Machine type communications: key drivers and enablers towards the 6G era.
EURASIP J. Wirel. Commun. Netw., 2021

On the Properties of Error Patterns in the Constant Lee Weight Channel.
CoRR, 2021

Efficient Decoding of Folded Linearized Reed-Solomon Codes in the Sum-Rank Metric.
CoRR, 2021

Decoding of Interleaved Linearized Reed-Solomon Codes with Applications to Network Coding.
Proceedings of the IEEE International Symposium on Information Theory, 2021

2020
White Paper on Critical and Massive Machine Type Communication Towards 6G.
CoRR, 2020

Protograph-Based Decoding of LDPC Codes with Hamming Weight Amplifiers.
CoRR, 2020

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

Protograph-Based Decoding of Low-Density Parity-Check Codes with Hamming Weight Amplifiers.
Proceedings of the Code-Based Cryptography - 8th International Workshop, 2020

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

Improved syndrome decoding of lifted $$L$$ L -interleaved Gabidulin codes.
Des. Codes Cryptogr., 2019

Efficient Decoding of Interleaved Low-Rank Parity-Check Codes.
Proceedings of the XVI International Symposium "Problems of Redundancy in Information and Control Systems", 2019

Fast Root Finding for Interpolation-Based Decoding of Interleaved Gabidulin Codes.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Weak Keys in the Faure-Loidreau Cryptosystem.
Proceedings of the Code-Based Cryptography - 7th International Workshop, 2019

2018
On Decoding Schemes for the MDPC-McEliece Cryptosystem.
CoRR, 2018

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

Protograph-based Quasi-Cyclic MDPC Codes for McEliece Cryptosystems.
Proceedings of the 10th IEEE International Symposium on Turbo Codes & Iterative Information Processing, 2018

2017
Algebraic Decoding of Subspace and Rank-Metric Codes.
PhD thesis, 2017

On Syndrome Decoding of Punctured Reed-Solomon and Gabidulin Codes.
Electron. Notes Discret. Math., 2017

Algebraic decoding of folded Gabidulin codes.
Des. Codes Cryptogr., 2017

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

2015
List and probabilistic unique decoding of folded subspace codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

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

2010
Practical Network Coding with Resilient Subspace Codes.
Proceedings of the 19th International Conference on Computer Communications and Networks, 2010


  Loading...