83 citations · 226 across the 17 of their papers we have counts for
11 papers · 1 filter
On MMSE estimation from quantized observations in the nonasymptotic regime
Jaeho Lee, Maxim Raginsky, Pierre Moulin
This paper studies MMSE estimation on the basis of quantized noisy observations. It presents nonasymptotic bounds on MMSE regret due to quantization for two settings: (1) estimatio…
Fixed Error Asymptotics For Erasure and List Decoding
Vincent Y. F. Tan, Pierre Moulin
We derive the optimum second-order coding rates, known as second-order capacities, for erasure and list decoding. For erasure decoding for discrete memoryless channels, we show tha…
The Log-Volume of Optimal Codes for Memoryless Channels, Asymptotically Within A Few Nats
Pierre Moulin
Shannon's analysis of the fundamental capacity limits for memoryless communication channels has been refined over time. In this paper, the maximum volume $M_\avg^*(n,ε)$ of length-…
On the Saddle-point Solution and the Large-Coalition Asymptotics of Fingerprinting Games
Yen-Wei Huang, Pierre Moulin
We study a fingerprinting game in which the number of colluders and the collusion channel are unknown. The encoder embeds fingerprints into a host sequence and provides the decoder…
Saddle-point Solution of the Fingerprinting Capacity Game Under the Marking Assumption
Yen-Wei Huang, Pierre Moulin
We study a fingerprinting game in which the collusion channel is unknown. The encoder embeds fingerprints into a host sequence and provides the decoder with the capability to trace…
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…