• DocumentCode
    3275584
  • Title

    Cover-free families and superimposed codes: constructions, bounds and applications to cryptography and group testing

  • Author

    D´yachkov, A.G. ; Lebedev, Vladimir S. ; Vilenkin, Pavel A. ; Yekhanin, Sergei M.

  • Author_Institution
    Moscow State Univ., Russia
  • fYear
    2001
  • fDate
    2001
  • Firstpage
    117
  • Abstract
    This paper deals with (s,l)-cover-free families or superimposed (s,l)-codes. They generalize the concept of superimposed s-codes and have several applications for cryptography and group testing. We present a new asymptotic bound on the rate of optimal codes and develop some constructions
  • Keywords
    codes; cryptography; group theory; optimisation; asymptotic bound; cover-free families; cryptography; group testing; optimal code rate; superimposed codes; Binary codes; Concatenated codes; Cryptography; Reed-Solomon codes; Secure storage; Testing; Upper bound;
  • 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.935980
  • Filename
    935980
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3275584