New upper bounds for wide-sense frameproof codes
From MaRDI portal
Cites work
- A short proof of Sperner's lemma
- A tight bound for frameproof codes viewed in terms of separating hash families
- An upper bound on the size of a code with the \(k\)-identifiable parent property
- Asymptotic bounds on frameproof codes
- Bounds on Traceability Schemes
- Collusion-secure fingerprinting for digital data
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Combinatorial properties of frameproof and traceability codes
- Digital fingerprinting codes: problem statements, constructions, identification of traitors
- Ein Satz über Untermengen einer endlichen Menge.
- Families of finite sets in which no intersection of sets is covered by the union of s others
- Frameproof Codes
- scientific article; zbMATH DE number 3974960 (Why is no real title available?)
- scientific article; zbMATH DE number 1996248 (Why is no real title available?)
- Improved Constructions of Frameproof Codes
- Improved upper bounds for wide-sense frameproof codes
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- New Bounds for Frameproof Codes
- New Lower Bounds for Secure Codes and Related Hash Families: A Hypergraph Theoretical Approach
- New upper bounds for parent-identifying codes and traceability codes
- On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
- On tight bounds for binary frameproof codes
- Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
- Sparse hypergraphs with applications to coding theory
- Traceability codes
- Wide-sense 2-frameproof codes
This page was built for publication: New upper bounds for wide-sense frameproof codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6933652)
