42 citations · 110 across the 10 of their papers we have counts for
1 paper · 2 filters
Thomas Schürmann
Let WN be an exact length-N block from a strictly positive i.i.d. source p on a fixed finite alphabet. We prove that the canonical T-complexity cT satisfies \[ \f…