5 citations · 8 across the 3 of their papers we have counts for
9 papers · 1 filter
Short Huffman Codes Producing 1s Half of the Time
Fabian Altenbach, Georg Böcherer, Rudolf Mathar
The design of the channel part of a digital communication system (e.g., error correction, modulation) is heavily based on the assumption that the data to be transmitted forms a fai…
Writing on the Facade of RWTH ICT Cubes: Cost Constrained Geometric Huffman Coding
Georg Böcherer, Fabian Altenbach, Martina Malsbender +1
In this work, a coding technique called cost constrained Geometric Huffman coding (ccGhc) is developed. ccGhc minimizes the Kullback-Leibler distance between a dyadic probability m…
Operating LDPC Codes with Zero Shaping Gap
Georg Böcherer, Rudolf Mathar
Unequal transition probabilities between input and output symbols, input power constraints, or input symbols of unequal durations can lead to non-uniform capacity achieving input d…
On the Achievable Rate of Stationary Rayleigh Flat-Fading Channels with Gaussian Inputs
Meik Dörpinghaus, Heinrich Meyr
In this work, we consider a discrete-time stationary Rayleigh flat-fading channel with unknown channel state information at transmitter and receiver. The law of the channel is pres…
Capacity Achieving Modulation for Fixed Constellations with Average Power Constraint
Georg Böcherer, Fabian Altenbach, Rudolf Mathar
The capacity achieving probability mass function (PMF) of a finite signal constellation with an average power constraint is in most cases non-uniform. A common approach to generate…
On the Throughput/Bit-Cost Tradeoff in CSMA Based Cooperative Networks
Georg Böcherer
Wireless local area networks (WLAN) still suffer from a severe performance discrepancy between different users in the uplink. This is because of the spatially varying channel condi…