• DocumentCode
    2941269
  • Title

    Random Binary Fingerprinting Codes for Arbitrarily Sized Coalitions

  • Author

    Anthapadmanabhan, N. Prasanth ; Barg, Alexander

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Maryland Univ., College Park, MD
  • fYear
    2006
  • fDate
    9-14 July 2006
  • Firstpage
    351
  • Lastpage
    355
  • Abstract
    New lower bounds are established on the rate of fingerprinting codes secure against coalitions of an arbitrary constant size t. In particular, it is proved that there exist sequences of binary fingerprinting codes with vanishing probability of misidentification and rate approximately 1/(t22t). In the case of t = 3 it is shown that there exist codes of rate 0.064 which is better by an order of magnitude than previously known results
  • Keywords
    binary codes; random codes; arbitrarily sized coalitions; random binary fingerprinting codes; Binary codes; Decoding; Educational institutions; Error analysis; Error probability; Fingerprint recognition; Probability distribution; Protection;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2006 IEEE International Symposium on
  • Conference_Location
    Seattle, WA
  • Print_ISBN
    1-4244-0505-X
  • Electronic_ISBN
    1-4244-0504-1
  • Type

    conf

  • DOI
    10.1109/ISIT.2006.261612
  • Filename
    4035981
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2941269