Cover-free codes and separating system codes

A. G. D’yachkov, I. V. Vorobyev, N. A. Polyanskii, V. Yu Shchukin

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


We give some relations between the asymptotic rates of cover-free (CF) codes, separating system (SS) codes and completely separating system (CSS) codes. We also provide new upper bounds on the asymptotic rate of SS codes based on known results for CF and CSS codes. Finally, we derive a random coding bound for the asymptotic rate of SS codes and give tables of numerical values corresponding to our improved upper bounds.

Original languageEnglish
Pages (from-to)197-209
Number of pages13
JournalDesigns, Codes, and Cryptography
Issue number1-2
Publication statusPublished - 1 Jan 2017
Externally publishedYes


  • Completely separating system codes
  • Cover-free codes
  • Digital fingerprinting
  • Frameproof codes
  • Separating system codes


Dive into the research topics of 'Cover-free codes and separating system codes'. Together they form a unique fingerprint.

Cite this