• DocumentCode
    3275603
  • Title

    On some efficient constructions of frameproof codes

  • Author

    Cohen, Gérard ; Encheva, Sylvia

  • Author_Institution
    ENST, Paris, France
  • fYear
    2001
  • fDate
    2001
  • Firstpage
    118
  • Abstract
    If C is a code of length n over a p-ary alphabet, then x is called a descendant of the code-words a,b,…,e if xi ∈{a i,bi,…,ei} for i=1,…,n. We study codes with the following property: the descendant of any coalition of codewords of a given maximal size does not belong to C
  • Keywords
    Golay codes; binary codes; linear codes; Golay code; binary frameproof codes; broadcast encryption model; code length; codewords; efficient code construction; linear codes; maximal code size; pirate decoder; Binary codes; Broadcasting; Cryptography; Decoding; Fingerprint recognition; Linear code; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2001. Proceedings. 2001 IEEE International Symposium on
  • Conference_Location
    Washington, DC
  • Print_ISBN
    0-7803-7123-2
  • Type

    conf

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