|
Asymptotic code bounds of binary Tardos codes under the weak marking assumption Host Publication: 15th IEEE International Workshop on Multimedia Signal Processing (MMSP) Authors: G. Fodor, A. Dooms and P. Schelkens Publisher: IEEE Publication Date: Oct. 2013 ISBN: 978-1-4799-0125-8
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.
|
