Equal-Weight Fingerprinting Codes
From MaRDI portal
Publication:5322997
DOI10.1007/978-3-642-01877-0_5zbMATH Open1248.94047OpenAlexW1606903272MaRDI QIDQ5322997FDOQ5322997
Authors: I. I. Dumer
Publication date: 23 July 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-01877-0_5
Recommendations
Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Decoding (94B35)
Cites Work
- Collusion-secure fingerprinting for digital data
- On the upper bound of the size of the \(r\)-cover-free families
- Digital fingerprinting codes: problem statements, constructions, identification of traitors
- Title not available (Why is that?)
- On codes with the identifiable parent property
- Optimal probabilistic fingerprint codes
- Tardos Fingerprinting is Better Than We Thought
- An upper bound on the size of a code with the \(k\)-identifiable parent property
- A hypergraph approach to the identifying parent property: The case of multiple parents
- On the Fingerprinting Capacity Under the Marking Assumption
Cited In (8)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
- Binary fingerprinting codes
- Optimal probabilistic fingerprint codes
- Title not available (Why is that?)
- Information Security Practice and Experience
- Codes for copyright protection: the case of two pirates
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)