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 date

2005

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
560views
0downloads

Technical informations

Creation

06/03/2015 17:12:07

First validation

06/03/2015 17:12:07

Update

14/03/2023 22:58:39

Status update

14/03/2023 22:58:39

Last indexation

30/10/2024 23:17:47
All rights reserved by Archive ouverte UNIGE and the University of Geneva
OpenAIRE Indexed & Validated