70 citations · 342 across the 36 of their papers we have counts for
6 papers · 1 filter
Informational Divergence and Entropy Rate on Rooted Trees with Probabilities
Georg Böcherer, Rana Ali Amjad
Rooted trees with probabilities are used to analyze properties of a variable length code. A bound is derived on the difference between the entropy rates of the code and a memoryles…
Fixed-to-Variable Length Resolution Coding for Target Distributions
Georg Böcherer, Rana Ali Amjad
The number of random bits required to approximate a target distribution in terms of un-normalized informational divergence is considered. It is shown that for a variable-to-variabl…
Optimal Quantization for Distribution Synthesis
Georg Böcherer, Bernhard C. Geiger
Finite precision approximations of discrete probability distributions are considered, applicable for distribution synthesis, e.g., probabilistic shaping. Two algorithms are present…
Block-to-Block Distribution Matching
Georg Böcherer, Rana Ali Amjad
In this work, binary block-to-block distribution matching is considered. m independent and uniformly distributed bits are mapped to n output bits resembling a target product distri…
Rooted Trees with Probabilities Revisited
Georg Böcherer
Rooted trees with probabilities are convenient to represent a class of random processes with memory. They allow to describe and analyze variable length codes for data compression a…
Fixed-to-Variable Length Distribution Matching
Rana Ali Amjad, Georg Böcherer
Fixed-to-variable length (f2v) matchers are used to reversibly transform an input sequence of independent and uniformly distributed bits into an output sequence of bits that are (a…