47 citations · 127 across the 8 of their papers we have counts for
27 papers
Iterative Reed-Muller Decoding
Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada +2
Reed-Muller (RM) codes are known for their good maximum likelihood (ML) performance in the short block-length regime. Despite being one of the oldest classes of channel codes, find…
Serial vs. Parallel Turbo-Autoencoders and Accelerated Training for Learned Channel Codes
Jannis Clausius, Sebastian Dörner, Sebastian Cammerer +1
Attracted by its scalability towards practical codeword lengths, we revisit the idea of Turbo-autoencoders for end-to-end learning of PHY-Layer communications. For this, we study t…
Wiener Filter versus Recurrent Neural Network-based 2D-Channel Estimation for V2X Communications
Moritz Benedikt Fischer, Sebastian Dörner, Sebastian Cammerer +4
We compare the potential of neural network (NN)-based channel estimation with classical linear minimum mean square error (LMMSE)-based estimators, also known as Wiener filtering. F…
On the Automorphism Group of Polar Codes
Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada +2
The automorphism group of a code is the set of permutations of the codeword symbols that map the whole code onto itself. For polar codes, only a part of the automorphism group was…
Iterative Detection and Decoding of Finite-Length Polar Codes in Gaussian Multiple Access Channels
Moustafa Ebada, Sebastian Cammerer, Ahmed Elkelesh +2
We consider the usage of finite-length polar codes for the Gaussian multiple access channel (GMAC) with a finite number of users. Based on the interleave-division multipleaccess (I…
Automorphism Ensemble Decoding of Reed-Muller Codes
Marvin Geiselhart, Ahmed Elkelesh, Moustafa Ebada +2
Reed-Muller (RM) codes are known for their good maximum likelihood (ML) performance in the short block-length regime. Despite being one of the oldest classes of channel codes, find…