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

Research output: Chapter in Book/Report/Conference proceedingConference paper

Abstract

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.
Original languageEnglish
Title of host publication15th IEEE International Workshop on Multimedia Signal Processing (MMSP)
PublisherIEEE
ISBN (Print)978-1-4799-0125-8
Publication statusPublished - 2 Oct 2013
Event15th IEEE International Workshop on Multimedia Signal Processing (MMSP) - Pula, Italy
Duration: 2 Oct 2013 → …

Conference

Conference15th IEEE International Workshop on Multimedia Signal Processing (MMSP)
Abbreviated title(MMSP)
Country/TerritoryItaly
CityPula
Period2/10/13 → …

Keywords

  • fingerprinting
  • traitor tracing
  • watermarking

Fingerprint

Dive into the research topics of 'Asymptotic code bounds of binary Tardos codes under the weak marking assumption'. Together they form a unique fingerprint.

Cite this