83 citations · 226 across the 17 of their papers we have counts for
Showing 2008 · cs.ITShow all
3 papers · 2 filters
cs.IT2008★ 8 cited
Blind Fingerprinting
Ying Wang, Pierre Moulin
We study blind fingerprinting, where the host sequence into which fingerprints are embedded is partially or completely unknown to the decoder. This problem relates to a multiuser v…
cs.IT2008★ 2 cited
A Neyman-Pearson Approach to Universal Erasure and List Decoding
Pierre Moulin
When information is to be transmitted over an unknown, possibly unreliable channel, an erasure option at the decoder is desirable. Using constant-composition random codes, we propo…
cs.IT2008★ 12 cited
Universal Fingerprinting: Capacity and Random-Coding Exponents
Pierre Moulin
This paper studies fingerprinting (traitor tracing) games in which the number of colluders and the collusion channel are unknown. The fingerprints are embedded into host sequences…