Binary and q-ary Tardos codes, revisited
From MaRDI portal
(Redirected from Binary and q-ary Tardos codes, revisited)
Binary and \(q\)-ary Tardos codes, revisited
Binary and \(q\)-ary Tardos codes, revisited
Recommendations
- Tardos Fingerprinting is Better Than We Thought
- An improvement of discrete Tardos fingerprinting codes
- An Improvement of Tardos’s Collusion-Secure Fingerprinting Codes with Very Short Lengths
- Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
- Improved versions of Tardos' fingerprinting scheme
Cites work
- Accusation probabilities in Tardos codes: beyond the Gaussian approximation
- An improvement of discrete Tardos fingerprinting codes
- Collusion-secure fingerprinting for digital data
- scientific article; zbMATH DE number 7051201 (Why is no real title available?)
- Improved versions of Tardos' fingerprinting scheme
- Optimal probabilistic fingerprint codes
- Optimal symmetric Tardos traitor tracing schemes
- Partition Asymptotics from Recursion Equations
- Probability Inequalities for the Sum of Independent Random Variables
- Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
- Tardos Fingerprinting is Better Than We Thought
Cited in
(7)- Efficient q-ary immutable codes
- False positive probabilities in \(q\)-ary Tardos codes: comparison of attacks
- The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes
- Tardos Fingerprinting is Better Than We Thought
- Accusation probabilities in Tardos codes: beyond the Gaussian approximation
- False negative probabilities in Tardos codes
- An improvement of discrete Tardos fingerprinting codes
This page was built for publication: Binary and \(q\)-ary Tardos codes, revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488254)
