Equal-Weight Fingerprinting Codes
From MaRDI portal
Recommendations
Cites work
- A hypergraph approach to the identifying parent property: The case of multiple parents
- An upper bound on the size of a code with the \(k\)-identifiable parent property
- Collusion-secure fingerprinting for digital data
- Digital fingerprinting codes: problem statements, constructions, identification of traitors
- scientific article; zbMATH DE number 1406785 (Why is no real title available?)
- On codes with the identifiable parent property
- On the Fingerprinting Capacity Under the Marking Assumption
- On the upper bound of the size of the \(r\)-cover-free families
- Optimal probabilistic fingerprint codes
- Tardos Fingerprinting is Better Than We Thought
Cited in
(8)- Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
- Codes for copyright protection: the case of two pirates
- Binary fingerprinting codes
- scientific article; zbMATH DE number 1941260 (Why is no real title available?)
- scientific article; zbMATH DE number 1955790 (Why is no real title available?)
- scientific article; zbMATH DE number 7051201 (Why is no real title available?)
- Information Security Practice and Experience
- Optimal probabilistic fingerprint codes
This page was built for publication: Equal-Weight Fingerprinting Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5322997)