Binary and \(q\)-ary Tardos codes, revisited
From MaRDI portal
Publication:488254
DOI10.1007/s10623-013-9842-3zbMath1351.94065OpenAlexW2025381528MaRDI QIDQ488254
Jan-Jaap Oosterwijk, Boris Škorić
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
Related Items (1)
Cites Work
- Unnamed Item
- Accusation probabilities in Tardos codes: beyond the Gaussian approximation
- An improvement of discrete Tardos fingerprinting codes
- Symmetric Tardos fingerprinting codes for arbitrary alphabet sizes
- Improved versions of Tardos' fingerprinting scheme
- Optimal symmetric Tardos traitor tracing schemes
- Probability Inequalities for the Sum of Independent Random Variables
- Tardos Fingerprinting is Better Than We Thought
- Collusion-secure fingerprinting for digital data
- Partition Asymptotics from Recursion Equations
- Optimal probabilistic fingerprint codes
This page was built for publication: Binary and \(q\)-ary Tardos codes, revisited