The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Fingerprinting codes provide a means for the digital content distributor to trace the origin of an unauthorized redistribution. The maximum achievable rate, or capacity, has recently been derived as the value of a two-person zero-sum game between the fingerprinting embedder and the pirates. Under the so-called Boneh-Shaw marking assumption, we prove rigorously that the asymptotic capacity is 1/(k2...
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 propose a generalization of Csiszar and Korner's maximum mutual information (MMI) decoder with an erasure option for discrete memoryless channels. The new decoder is parameterized by a weighting function that is designed to optimize...
Bounds on fingerprinting capacity have been derived in recent literature. In this paper we present an exact capacity formula and a universal fingerprinting scheme. Our problem setup unifies the signal-distortion and Boneh-Shaw formulations of fingerprinting. The proposed scheme has four useful properties: (1) the receiver does not need to know the coalition size and collusion channel; (2) a tunable...
We study communication over an unknown, possibly unreliable, discrete memoryless channel. For such problems, an erasure option at the decoder is desirable. We use constant-composition random codes and propose a generalization of the Maximum Mutual Information decoder. The proposed decoder is parameterized by a weighting function that can be designed to optimize the fundamental tradeoff between undetected-error...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.