en
Proceedings chapter
English

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

Presented at Antalya (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
413views
0downloads

Technical informations

Creation03/06/2015 5:12:07 PM
First validation03/06/2015 5:12:07 PM
Update time03/14/2023 10:58:39 PM
Status update03/14/2023 10:58:39 PM
Last indexation01/16/2024 5:08:29 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack