Asymptotic code bounds of binary Tardos codes under the weak marking assumption

Onderzoeksoutput: Conference paper

Samenvatting

The Tardos code is a popular fingerprinting code due to its asymptotically optimal code length under the strong marking assumption. When these codes are embedded as watermarks or transmitted over un-secure channels, we commonly encounter erasure and flipping errors. In this paper we derive asymptotic bounds on the minimum code length to cope with these distortions and point out further research ideas of both theoretical and practical importance.
Originele taal-2English
Titel15th IEEE International Workshop on Multimedia Signal Processing (MMSP)
UitgeverijIEEE
ISBN van geprinte versie978-1-4799-0125-8
StatusPublished - 2 okt 2013
EvenementUnknown - Pula, Italy
Duur: 2 okt 2013 → …

Conference

ConferenceUnknown
Verkorte titel(MMSP)
Land/RegioItaly
StadPula
Periode2/10/13 → …

Vingerafdruk

Duik in de onderzoeksthema's van 'Asymptotic code bounds of binary Tardos codes under the weak marking assumption'. Samen vormen ze een unieke vingerafdruk.

Citeer dit