Proceedings chapter
English

Joint Achievable Rate-Complexity Analysis of Geometrically Robust Data-hiding Codes in Asymptotic Set-ups

Presented atAntalya (Turkey), Sept. 4-8
Publication date2005
Citation (ISO format)
TOPAK, Emre et al. Joint Achievable Rate-Complexity Analysis of Geometrically Robust Data-hiding Codes in Asymptotic Set-ups. In: Proceedings of 13th European Signal Processing Conference, EUSIPCO 2005. Antalya (Turkey). [s.l.] : [s.n.], 2005.
Identifiers
  • PID : unige:47689
437views
0downloads

Technical informations

Creation06/03/2015 18:12:07
First validation06/03/2015 18:12:07
Update time14/03/2023 23:58:39
Status update14/03/2023 23:58:39
Last indexation31/10/2024 00:17:47
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack