On random coding error exponents of watermarking systems

IEEE Transactions on Information Theory

Volumn 46, Issue 2, 2000, Pages 420-430

  Merhav, Neri ^a,b,c  

^a IEEE   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RANDOM CODING ERROR EXPONENTS; STEGANOGRAPHY; WATERMARKING SYSTEMS;

COMMUNICATION CHANNELS (INFORMATION THEORY); DATA PRIVACY; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES; SECURITY OF DATA;

SIGNAL ENCODING;

EID: 0033871878     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.825801     Document Type: Article

References (22)

1. R. Anderson, "Stretching the limits of steganography," in Information Hiding. New York, NY: Springer-Verlag, 1996, vol. 1174, pp. 39-48. Springer Lecture Notes in Computer Science.
2. R. J. Anderson and A. Petitcolas, "On the limits of steganography," IEEE J. Select. Areas Commun., vol. 16, pp. 463-4173, May 1998.
3. M. Avriel, Nonlinear Programming Analysis and Methods. Englewood Cliffs, NJ: Prentice-Hall, 1976.
4. S. Graver, N. Memon, B.-L. Yeo, and M. M. Yeung, "Resolving rightful ownerships with invisible watermarking techniques: Limitations, attacks, and implications," IEEE J. Select. Areas Commun., vol. 16, pp. 573-586, May 1998.
5. I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems. New York: Academic, 1981.
6. T. Ericson, "Exponential error bounds for random codes in arbitrarily varying channels," IEEE Trans. Inform. Theory, vol. IT-31, pp. 42-418, Jan. 1985.
7. M. Feder and A. Lapidoth, "Universal decoders for channels with memory," IEEE Trans. Inform. Theory, vol. 44, pp. 1726-1745, Sept. 1998.
8. R. G. Gallager, "A simple derivation of the coding theorem and some applications," IEEE Trans. Inform. Theory, vol. IT-11, pp. 3-18, Jan. 1965.
9. _, Information Theory and Reliable Communication. New York: Wiley, 1968.
10. _, "The random coding bound is tight for the average code," IEEE Trans. Inform. Theory, vol. IT-19, pp. 244-246, Mar. 1973.
11. E. Geraniotis, "Minimax robust coding for channels with uncertain statistics," IEEE Trans. Inform. Theory, vol. IT-31, pp. 802-811, Nov. 1985.
12. V. D. Goppa, "Nonprobabilistic mutual information without memory," Probl. Contr. Inform. Theory, vol. 4, pp. 97-102, 1975.
13. B. L. Hughes and T. G. Thomas, "On error exponents for arbitrarily varying channels," IEEE Trans. Inform. Theory, vol. 42, pp. 87-98, Jan. 1996.
14. A. Lapidoth and J. Ziv, "On the universality of the LZ-based decoding algorithm," IEEE Trans. Inform. Theory, vol. 44, pp. 1746-1755, Sept. 1998.
15. N. Merhav, "Universal decoding for memoryless Gaussian channels with a deterministic interference," IEEE Trans. Inform. Theory, vol. 39, pp. 1261-1269, July 1993.
16. J. A. O'Sullivan, P. Moulin, and J. M. Ettinger, "Information theoretic analysis of steganography," in Proc. ISIT'98, 1998, p. 297.
17. S. D. Servetto, C. I. Podilchuk, and K. Ramchandran, "Capacity issues in digital image watermarking," in Proc. ICIP'98, 1998.
18. I. G. Stiglitz, "Coding for a class of unknown channels," IEEE Trans. Inform. Theory, vol. IT-12, pp. 189-195, Apr. 1966. (Correction: vol. IT-13, p. 195).
19. I. G. Stiglitz, "A coding theorem for a class of unknown channels, "IEEE Trans. Inform. Theory, vol. IT-13, pp. 217-220, Apr. 1967.
20. J. Stoer and C. Witzgall, Convexity and Optimization in Finite Dimensions I. New York: Springer-Verlag, 1970.
21. J. Ziv, "Universal decoding for finite-state channels," IEEE Trans. Inform. Theory, vol. IT-31, pp. 453-460, July 1985.
22. A. Cohen and A. Lapidoth, On the Gaussian Watermarking Game, preprint, 1993.