skip to content

Limit capacity of non-stochastic steganographic systems and Hausdorff dimension

Presented by: 
D Ryabko [INRIA, Lille, France]
Thursday 5th July 2012 - 17:00 to 17:30
INI Seminar Room 1
It 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.
The video for this talk should appear here if JavaScript is enabled.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.
University of Cambridge Research Councils UK
    Clay Mathematics Institute London Mathematical Society NM Rothschild and Sons