ACHIEVABLE RATE ANALYSIS OF GEOMETRICALLY ROBUST DATA-HIDING CODES IN ASYMPTOTIC SET-UPS (ThuAmOR8)

Author(s) : Emre Topak (University of Geneva, Switzerland) Sviatoslav Voloshynovskiy (University of Geneva, Switzerland) Oleksiy Koval (University of Geneva, Switzerland) Thierry Pun (University of Geneva, Switzerland)

Abstract : Geometrical transformations bring synchronization problems into the robust digital data-hiding. Previous works on this subject were concentrated on the robustness to particular geometrical transformations. In this paper, the achievable rates of reliable robust data-hiding in channels with geometrical transformations are investigated from an information-theoretic point of view for theoretical set-ups, where lengths of data sequences asymptotically approach infinity.

Menu