Constantin Runge
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Constantin Runge has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Diego Lentner
Institute for Communications Engineering Technical University of Munich 80333 Munich Germany
2 shared publications - Thomas Wiegart
Technical University of Munich Munich Germany
2 shared publications - Gerhard Kramer
Technical University of Munich
1 shared publication - Tobias Prinz
Institute for Communications Engineering at TUM, Germany
1 shared publication
Latest Publications
- Open Access
Time-Shifted Alternating Gelfand-Pinsker Coding for Broadcast Channels
A coding scheme for broadcast channels (BCs) is proposed that shifts the users' code blocks by different amounts of time and applies alternating Gelfand-Pinsker encoding. The scheme achieves all rate tuples in Marton's region for two receiver BCs without time-sharing or rate-splitting. Simulations with short polar codes show that the method reduces the gap to capacity as compared to time-sharing.
Open AccessTime-Shifted Alternating Gelfand-Pinsker Coding for Broadcast Channels
A coding scheme for broadcast channels (BCs) is proposed that shifts the users' code blocks by different amounts of time and applies alternating Gelfand-Pinsker encoding. The scheme achieves all rate tuples in Marton's region for two receiver BCs without time-sharing or rate-splitting. Simulations with short polar codes show that the method reduces the gap to capacity as compared to time-sharing.
- Open Access
Improved List Decoding for Polar-Coded Probabilistic Shaping
A modified successive cancellation list (SCL) decoder is proposed for polar-coded probabilistic shaping. The decoder exploits the deterministic encoding rule for shaping bits to rule out candidate code words that the encoder would not generate. This provides error detection and decreases error rates compared to standard SCL decoding while at the same time reducing the length of the outer cyclic redundancy check code.
Open AccessImproved List Decoding for Polar-Coded Probabilistic Shaping
A modified successive cancellation list (SCL) decoder is proposed for polar-coded probabilistic shaping. The decoder exploits the deterministic encoding rule for shaping bits to rule out candidate code words that the encoder would not generate. This provides error detection and decreases error rates compared to standard SCL decoding while at the same time reducing the length of the outer cyclic redundancy check code.
- Open Access
Multilevel Binary Polar-Coded Modulation Achieving the Capacity of Asymmetric Channels
A multilevel coded modulation scheme is studied that uses solely binary polar codes and Honda-Yamamoto probabilistic shaping. The scheme is shown to achieve the capacity of discrete memoryless channels with input alphabets of cardinality a power of two. The performance of finite-length implementations is compared to polar-coded probabilistic amplitude shaping and constant composition distribution matching.
Open AccessMultilevel Binary Polar-Coded Modulation Achieving the Capacity of Asymmetric Channels
A multilevel coded modulation scheme is studied that uses solely binary polar codes and Honda-Yamamoto probabilistic shaping. The scheme is shown to achieve the capacity of discrete memoryless channels with input alphabets of cardinality a power of two. The performance of finite-length implementations is compared to polar-coded probabilistic amplitude shaping and constant composition distribution matching.