Fingerprinting Capacity Under the Marking Assumption

@article{Anthapadmanabhan2007FingerprintingCU,
  title={Fingerprinting Capacity Under the Marking Assumption},
  author={N. Prasanth Anthapadmanabhan and Alexander Barg and Ilya Dumer},
  journal={2007 IEEE International Symposium on Information Theory},
  year={2007},
  pages={706-710}
}
We study the maximum attainable rate or capacity of fingerprinting codes under the marking assumption. It is proved that capacity for fingerprinting against coalitions of size two and three over the binary alphabet satisfies 0.25 les C2,2 les 0.322 and 0.083 les C3,2 les 0.199 respectively. For coalitions of an arbitrary fixed size, we derive a closed-form upper bound on fingerprinting capacity in the binary case. Finally, for general alphabets, we establish upper bounds on the fingerprinting… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
13 Citations
19 References
Similar Papers

References

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

An Introduction to Probability Theory and Its Applications

  • W. Feller
  • vol. II, New York, N.Y.: John Wiley & Sons
  • 1971
Highly Influential
3 Excerpts

Kabatiansky, “Random coding techniq ue for digital fingerprinting codes: fighting two pirates revisited,

  • G.G.R. Blakley
  • Proc. IEEE Internat. Sympos. Inform. Theory…
  • 2004
2 Excerpts

An upper bound on the size of a code with t he kidentifiable property,”J

  • S. R. Blackburn
  • Combinat. Theory Ser. A ,
  • 2003
1 Excerpt

Similar Papers

Loading similar papers…