9 citations · 10 across the 6 of their papers we have counts for
14 papers
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…
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…
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…
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…