Limit capacity of non-stochastic steganographic systems and Hausdorff dimension
Seminar Room 1, Newton Institute
AbstractIt was shown recently that the limit capacity of perfect steganography systems for i.i.d. and Markov sources equals the Shannon entropy of the ``cover'' process. Here we address the problem of limit capacity of general perfect steganographic systems. We show that this value asymptotically equals the Hausdorff dimension of the set of possible cover messages.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.