3 papers
cs.IT2022
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…
cs.IT2022
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…
cs.IT2021
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…