Asymptotically optimal 2 ¯ $\overline {2}$ -separable codes with length 4

Abstract

Multimedia fingerprinting is an effective technique to trace the sources of pirate copies of copyrighted multimedia information. Separable codes can be used to construct fingerprints resistant to the averaging collusion attack on multimedia contents. In this paper, we first show an equivalent condition of a \(\overline {2}\) -SC (4,M,q), and then construct two infinite families of \(\overline {2}\) -SCs of length 4, one of which is asymptotically optimal.

from #AlexandrosSfakianakis via Alexandros G.Sfakianakis on Inoreader http://ift.tt/2lo4y2q
via IFTTT