16 citations · 19 across the 16 of their papers we have counts for
6 papers · 1 filter
Optimizing Serially Concatenated Neural Codes with Classical Decoders
Jannis Clausius, Marvin Geiselhart, Stephan ten Brink
For improving short-length codes, we demonstrate that classic decoders can also be used with real-valued, neural encoders, i.e., deep-learning based codeword sequence generators. H…
Graph Search based Polar Code Design
Marvin Geiselhart, Andreas Zunker, Ahmed Elkelesh +2
It is well known that to fulfill their full potential, the design of polar codes must be tailored to their intended decoding algorithm. While for successive cancellation (SC) decod…
Learning Quantization in LDPC Decoders
Marvin Geiselhart, Ahmed Elkelesh, Jannis Clausius +4
Finding optimal message quantization is a key requirement for low complexity belief propagation (BP) decoding. To this end, we propose a floating-point surrogate model that imitate…
Learning Joint Detection, Equalization and Decoding for Short-Packet Communications
Sebastian Dörner, Jannis Clausius, Sebastian Cammerer +1
We propose and practically demonstrate a joint detection and decoding scheme for short-packet wireless communications in scenarios that require to first detect the presence of a me…
A Polar Subcode Approach to Belief Propagation List Decoding
Marvin Geiselhart, Ahmed Elkelesh, Jannis Clausius +1
Permutation decoding gained recent interest as it can exploit the symmetries of a code in a parallel fashion. Moreover, it has been shown that by viewing permuted polar codes as po…
Automorphism Ensemble Decoding of Quasi-Cyclic LDPC Codes by Breaking Graph Symmetries
Marvin Geiselhart, Moustafa Ebada, Ahmed Elkelesh +2
We consider automorphism ensemble decoding (AED) of quasi-cyclic (QC) low-density parity-check (LDPC) codes. Belief propagation (BP) decoding on the conventional factor graph is eq…