New Bounds on Separable Codes for Multimedia Fingerprinting

@article{Gao2014NewBO,
  title={New Bounds on Separable Codes for Multimedia Fingerprinting},
  author={Fei Gao and Gennian Ge},
  journal={IEEE Transactions on Information Theory},
  year={2014},
  volume={60},
  pages={5257-5262}
}
Multimedia fingerprinting is an effective technique to trace the sources of pirate copies of copyrighted multimedia contents. Separable codes were introduced to detect colluders taking part in the averaging attack, which is the most feasible approach to perform a collusion attack. In this paper, we provide some improved bounds for the size of separable codes. Using a combinatorial technique named grouping coordinates, we have greatly reduced the upper bound. On the other hand, we also provide… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
15 Extracted Citations
20 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 15 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 20 references

An extension of Stein-Lovász theorem and some of its applications

  • G.-S. Lee
  • J. Combinat. Optim., vol. 25, no. 1, pp. 1–18…
  • 2013
1 Excerpt

Similar Papers

Loading similar papers…