• DocumentCode
    997847
  • Title

    Upper bounds on separating codes

  • Author

    Cohen, Gérard D. ; Schaathun, Hans Georg

  • Author_Institution
    Dept. d´´Informatique et Reseaux, Ecole Nat. Superieure des Telecommun., Paris, France
  • Volume
    50
  • Issue
    6
  • fYear
    2004
  • fDate
    6/1/2004 12:00:00 AM
  • Firstpage
    1291
  • Lastpage
    1294
  • Abstract
    The combinatorial concept of separating systems has numerous applications, such as automata theory, digital fingerprinting, group testing, and hashing. In this correspondence, we derive upper bounds on the size of codes with various separating properties.
  • Keywords
    combinatorial mathematics; error correction codes; automata theory; combinatorial concept; digital finger printing; error-correcting codes; group testing; hashing; separating codes; separating system; superimposed codes; upper bound; Cryptography; Cyclic redundancy check; Error-correcting codes; hashing; separating systems; superimposed codes;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.2004.828140
  • Filename
    1302308
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=997847