Cover-free codes and separating system codes
From MaRDI portal
Publication:510467
DOI10.1007/s10623-016-0265-9zbMath1369.94592OpenAlexW3014328748MaRDI QIDQ510467
V. Yu. Shchukin, Arkadii G. D'yachkov, I. V. Vorob'ev, Nikita Polyanskii
Publication date: 10 February 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01276696/file/wcc15-fr2-3.pdf
digital fingerprintingcompletely separating system codescover-free codesframeproof codesseparating system codes
Related Items (3)
Almost cover-free codes ⋮ Some intriguing upper bounds for separating hash families ⋮ Cover-free codes and separating system codes
Cites Work
- Unnamed Item
- Cover-free codes and separating system codes
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
- Key storage in secure networks
- Completely separating systems
- Separating systems
- Bounds on the rate of disjunctive codes
- Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
- On generalized separating hash families
- Interval Packing and Covering in the Boolean Lattice
- Monotone Functions in Sequential Circuits
- Combinatorial properties of frameproof and traceability codes
- New Bounds for Frameproof Codes
- Digital fingerprinting codes: problem statements, constructions, identification of traitors
- Collusion-secure fingerprinting for digital data
This page was built for publication: Cover-free codes and separating system codes
