Sallee (2004) show that just as arithmetic coding is optimal for data compression, it is also optimal for steganography.
given any goal distribution p s (y) that one wants to sample from, starting with a uniform m and applying the deterministic steganography procedures yields a distribution q = p s or equivalently D KL (q||p s ) = 0 for long sequences.