42 citations · 110 across the 10 of their papers we have counts for
Showing math.STShow all
2 papers · 1 filter
math.ST2026
A First-Order Entropy Law for Canonical T-Complexity of Finite-Alphabet i.i.d. Sources
Thomas Schürmann
Let be an exact length- block from a strictly positive i.i.d. source on a fixed finite alphabet. We prove that the canonical T-complexity satisfies \[ \f…
math.ST2014★ 7 cited
Unbiased Estimators for Entropy and Class Number
Stephen Montgomery-Smith, T. Schürmann
We introduce unbiased estimators for the Shannon entropy and the class number, in the situation that we are able to take sequences of independent samples of arbitrary length.