Structured codes are known to be necessary in practical implementations of capacity-approaching "dirty paper schemes". In this paper we study the performance of a recently proposed dirty paper technique, by Erez and ten Brink which, to the authors knowledge, is firstly applied to data-hiding, and compare it with other existing approaches. Specifically, we compare it woth conventional side-informed schemes previously used in data-hiding based on repetition and turbo coding. We show that a significant improvement can be achieved using Erez and ten Brink's proposal. We also study the considerations we have to take into account when these codes are used in data-hiding, mainly related with perceptual questions.
展开▼
