No abstract

No abstract

Abstract-State-dependent channels have received much attention over the years, due to their relevance in many different network and multi-user communication scenarios. Nonetheless, previous treatments of this problem assumed that all of the state is available in the same manner: causally, non-causally or noncausally with a finite look-ahead. Yet, in many realistic situations, different parts of the state are known in a different manner. We consider the case where the state is composed of several parts, where each part is known with a different look-ahead. Specifically, we derive the capacity for the case where part of the state is known non-causally to the transmitter, whereas the other part is known only causally, and demonstrate that there are cases in which this capacity can be strictly larger that the capacity of the case where the state is known in a causal fashion, and strictly smaller than the capacity of the same channel, where the state is available non-causally. We note that the treatment in this work provides a unified framework for treating the causal state-information case, the non-causal state-information case, as well as a mixture of the two.

No abstract

We analyze the fingerprinting method in Kirovski et al. (2002) and suggest attacks that are better than the ones presented therein. To do this, we observe and use some extra information available in the system. We derive the optimal subtractive estimation attack structure in the sense of minimizing the expected value of the watermark detector statistics. Selection of different attack channel distortion constraints are also discussed. See Zhao et al. (2003) for various recently proposed attacks on spread spectrum fingerprinting systems for private watermarking.