en
Proceedings chapter
Open access
English

Achievable Rate Analysis of Geometrically Robust Data-Hiding Codes In Asymptotic Set-ups

Presented at Antalya (Turkey), Sept. 4-8
PublisherIEEE
Publication date2005
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 informationtheoretic point of view for theoretical set-ups, where lengths of data sequences asymptotically approach infinity

Keywords
  • data encapsulation
  • geometric codes
  • synchronisation
Citation (ISO format)
TOPAK, Emre et al. Achievable Rate Analysis of Geometrically Robust Data-Hiding Codes In Asymptotic Set-ups. In: Proceedings of the 13th European Signal Processing Conference, EUSIPCO 2005. Antalya (Turkey). [s.l.] : IEEE, 2005. p. 1–4.
Main files (1)
Proceedings chapter (Published version)
accessLevelPublic
Identifiers
  • PID : unige:47936
422views
59downloads

Technical informations

Creation03/06/2015 5:12:25 PM
First validation03/06/2015 5:12:25 PM
Update time03/14/2023 10:59:54 PM
Status update03/14/2023 10:59:54 PM
Last indexation01/16/2024 5:14:19 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack