default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarvin Geiselhart
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j4]Andreas Zunker
, Marvin Geiselhart, Lucas Johannsen, Claus Kestel, Stephan ten Brink, Timo Vogt, Norbert Wehn:
Row-Merged Polar Codes: Analysis, Design, and Decoder Implementation. IEEE Trans. Commun. 73(1): 39-53 (2025)- 2024
- [j3]Sisi Miao, Claus Kestel, Lucas Johannsen, Marvin Geiselhart, Laurent Schmalen, Alexios Balatsoukas-Stimming, Gianluigi Liva, Norbert Wehn, Stephan ten Brink:
Trends in Channel Coding for 6G. Proc. IEEE 112(7): 653-675 (2024) - [c14]Paul Bezner, Jannis Clausius, Marvin Geiselhart, Tim Janz, Felix Krieg, Simon Obermüller, Daniel Tandler, Stephan ten Brink:
Towards Flexible LDPC Coding for 6G. IEEECONF 2024: 1119-1125 - [c13]Andreas Zunker, Marvin Geiselhart, Stephan ten Brink:
Enumeration of Minimum Weight Codewords of Pre-Transformed Polar Codes by Tree Intersection. CISS 2024: 1-6 - [c12]Jannis Clausius, Marvin Geiselhart, Daniel Tandler, Stephan ten Brink:
Graph Neural Network-Based Joint Equalization and Decoding. ISIT 2024: 1203-1208 - [i21]Jannis Clausius, Marvin Geiselhart, Daniel Tandler, Stephan ten Brink:
Graph Neural Network-based Joint Equalization and Decoding. CoRR abs/2401.16187 (2024) - [i20]Simon Obermüller, Jannis Clausius, Marvin Geiselhart, Stephan ten Brink:
Bounds for Joint Detection and Decoding on the Binary-Input AWGN Channel. CoRR abs/2409.01119 (2024) - [i19]Marvin Geiselhart, Andreas Zunker, Felix Krieg, Stephan ten Brink:
Nested Symmetric Polar Codes. CoRR abs/2410.23885 (2024) - [i18]Felix Krieg, Jannis Clausius, Marvin Geiselhart, Stephan ten Brink:
A Comparative Study of Ensemble Decoding Methods for Short Length LDPC Codes. CoRR abs/2410.23980 (2024) - 2023
- [c11]Jannis Clausius, Marvin Geiselhart, Stephan ten Brink:
Component Training of Turbo Autoencoders. ISTC 2023: 1-5 - [c10]Marvin Geiselhart, Jannis Clausius, Stephan ten Brink:
Rate-Compatible Polar Codes for Automorphism Ensemble Decoding. ISTC 2023: 1-5 - [c9]Marvin Geiselhart, Marc Gauger, Felix Krieg, Jannis Clausius, Stephan ten Brink:
Phase-Equivariant Polar Coded Modulation. ISTC 2023: 1-5 - [c8]Lucas Johannsen, Claus Kestel, Marvin Geiselhart, Timo Vogt, Stephan ten Brink, Norbert Wehn:
Successive Cancellation Automorphism List Decoding of Polar Codes. ISTC 2023: 1-5 - [i17]Claus Kestel, Marvin Geiselhart, Lucas Johannsen, Stephan ten Brink, Norbert Wehn:
Automorphism Ensemble Polar Code Decoders for 6G URLLC. CoRR abs/2303.01235 (2023) - [i16]Marvin Geiselhart, Jannis Clausius, Stephan ten Brink:
Rate-Compatible Polar Codes for Automorphism Ensemble Decoding. CoRR abs/2305.01214 (2023) - [i15]Marvin Geiselhart, Marc Gauger, Felix Krieg, Jannis Clausius, Stephan ten Brink:
Phase-Equivariant Polar Coded Modulation. CoRR abs/2305.01972 (2023) - [i14]Jannis Clausius, Marvin Geiselhart, Stephan ten Brink:
Component Training of Turbo Autoencoders. CoRR abs/2305.09216 (2023) - [i13]Lucas Johannsen, Claus Kestel, Marvin Geiselhart, Timo Vogt, Stephan ten Brink, Norbert Wehn:
Successive Cancellation Automorphism List Decoding of Polar Codes. CoRR abs/2306.16245 (2023) - [i12]Andreas Zunker, Marvin Geiselhart, Stephan ten Brink:
Enumeration of Minimum Weight Codewords of Pre-Transformed Polar Codes by Tree Intersection. CoRR abs/2311.17774 (2023) - [i11]Andreas Zunker, Marvin Geiselhart, Lucas Johannsen, Claus Kestel, Stephan ten Brink, Timo Vogt, Norbert Wehn:
Row-Merged Polar Codes: Analysis, Design and Decoder Implementation. CoRR abs/2312.14749 (2023) - 2022
- [j2]Marvin Geiselhart, Moustafa Ebada, Ahmed Elkelesh, Jannis Clausius, Stephan ten Brink:
Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries. IEEE Commun. Lett. 26(8): 1705-1709 (2022) - [c7]Marvin Geiselhart, Andreas Zunker, Ahmed Elkelesh, Jannis Clausius, Stephan ten Brink:
Graph Search based Polar Code Design. IEEECONF 2022: 387-391 - [c6]Marvin Geiselhart, Ahmed Elkelesh, Jannis Clausius, Fei Liang, Wen Xu, Jing Liang, Stephan ten Brink:
Learning Quantization in LDPC Decoders. GLOBECOM (Workshops) 2022: 467-472 - [c5]Marvin Geiselhart, Ahmed Elkelesh, Jannis Clausius, Stephan ten Brink:
A Polar Subcode Approach to Belief Propagation List Decoding. ITW 2022: 243-248 - [i10]Marvin Geiselhart, Moustafa Ebada, Ahmed Elkelesh, Jannis Clausius, Stephan ten Brink:
Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries. CoRR abs/2202.00287 (2022) - [i9]Marvin Geiselhart, Ahmed Elkelesh, Jannis Clausius, Stephan ten Brink:
A Polar Subcode Approach to Belief Propagation List Decoding. CoRR abs/2205.06631 (2022) - [i8]Marvin Geiselhart, Ahmed Elkelesh, Jannis Clausius, Fei Liang, Wen Xu, Jing Liang, Stephan ten Brink:
Learning Quantization in LDPC Decoders. CoRR abs/2208.05186 (2022) - [i7]Marvin Geiselhart, Andreas Zunker, Ahmed Elkelesh, Jannis Clausius, Stephan ten Brink:
Graph Search based Polar Code Design. CoRR abs/2211.16010 (2022) - [i6]Jannis Clausius, Marvin Geiselhart, Stephan ten Brink:
Optimizing Serially Concatenated Neural Codes with Classical Decoders. CoRR abs/2212.10355 (2022) - 2021
- [j1]Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Automorphism Ensemble Decoding of Reed-Muller Codes. IEEE Trans. Commun. 69(10): 6424-6438 (2021) - [c4]Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
On the Automorphism Group of Polar Codes. ISIT 2021: 1230-1235 - [c3]Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Iterative Reed-Muller Decoding. ISTC 2021: 1-5 - [i5]Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
On the Automorphism Group of Polar Codes. CoRR abs/2101.09679 (2021) - [i4]Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Iterative Reed-Muller Decoding. CoRR abs/2107.12613 (2021) - 2020
- [c2]Moustafa Ebada, Sebastian Cammerer, Ahmed Elkelesh, Marvin Geiselhart, Stephan ten Brink:
Iterative Detection and Decoding of Finite-Length Polar Codes in Gaussian Multiple Access Channels. ACSSC 2020: 683-688 - [c1]Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
CRC-Aided Belief Propagation List Decoding of Polar Codes. ISIT 2020: 395-400 - [i3]Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
CRC-Aided Belief Propagation List Decoding of Polar Codes. CoRR abs/2001.05303 (2020) - [i2]Moustafa Ebada, Sebastian Cammerer, Ahmed Elkelesh, Marvin Geiselhart, Stephan ten Brink:
Iterative Detection and Decoding of Finite-Length Polar Codes in Gaussian Multiple Access Channels. CoRR abs/2012.01075 (2020) - [i1]Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada, Sebastian Cammerer, Stephan ten Brink:
Automorphism Ensemble Decoding of Reed-Muller Codes. CoRR abs/2012.07635 (2020)
Coauthor Index
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 2026-02-26 23:17 CET 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:
