67 citations · 178 across the 38 of their papers we have counts for
4 papers · 2 filters
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…
Matching Dyadic Distributions to Channels
Georg Böcherer, Rudolf Mathar
Many communication channels with discrete input have non-uniform capacity achieving probability mass functions (PMF). By parsing a stream of independent and equiprobable bits accor…
Throughput, Bit-Cost, Network State Information: Tradeoffs in Cooperative CSMA Protocols
Georg Bocherer, Rudolf Mathar
In wireless local area networks, spatially varying channel conditions result in a severe performance discrepancy between different nodes in the uplink, depending on their position.…
Deriving the Probabilistic Capacity of General Run-Length Sets Using Generating Functions
Georg Böcherer, Rudolf Mathar, Valdemar Cardoso da Rocha Junior +1
In "Reliable Communication in the Absence of a Common Clock" (Yeung et al., 2009), the authors introduce general run-length sets, which form a class of constrained systems that per…