Binary and q-ary Tardos codes, revisited
From MaRDI portal
Publication:488254
DOI10.1007/S10623-013-9842-3zbMATH Open1351.94065OpenAlexW2025381528MaRDI QIDQ488254FDOQ488254
Authors: Boris Škorić, Jan-Jaap Oosterwijk 
Publication date: 23 January 2015
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-013-9842-3
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
- Probability Inequalities for the Sum of Independent Random Variables
- Collusion-secure fingerprinting for digital data
- Optimal probabilistic fingerprint codes
- Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
- Improved versions of Tardos' fingerprinting scheme
- Tardos Fingerprinting is Better Than We Thought
- Accusation probabilities in Tardos codes: beyond the Gaussian approximation
- Optimal symmetric Tardos traitor tracing schemes
- Title not available (Why is that?)
- Partition Asymptotics from Recursion Equations
- An improvement of discrete Tardos fingerprinting codes
Cited In (6)
- False positive probabilities in \(q\)-ary Tardos codes: comparison of attacks
- Accusation probabilities in Tardos codes: beyond the Gaussian approximation
- The twisted squaring construction, trellis complexity, and generalized weights of BCH and QR codes
- Efficient \(q\)-ary immutable codes
- An improvement of discrete Tardos fingerprinting codes
- Tardos Fingerprinting is Better Than We Thought
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)
