On Estimates of Rate-reliability-distortion Function for Information Hiding System
Abstract
The model of information hiding system, introduced and studied by P. Moulin and J. A. O'Sullivan [1] is explored. The rate-reliability-distortion function for this system is investigated. Upper and lower estimates of rate-reliability-distortion function, called the random coding and the sphere packing bounds are constructed. The limit of random coding bound, when E → 0, coincides with the information hiding capacity stated by P. Moulin and J. A. O'Sullivan.
References
P. Moulin and J. A. O'Sullivan, "Information-theoretic analysis of information hiding", IEEE Trans. Inform. Theory, vol. 49, no. 3, pp. 563-593, Mar. 2003.
F. A. P. Petitcolas, R. J. Anderson, and M. G. Kuhn, "Information hiding–A Survey," Proc. IEEE (Special Issue on Identification and Protection of Multimedia Information), vol. 87, pp. 1062-1078, July 1999.
P. Moulin, "The role of information theory in watermarking and its application to image watermarking," Signal Processing, vol. 81, pp. 1121 -1139, 2001.
E. A. Haroutunian, "Upper estimate of transmission rate for memoryless channel with countable number of output signals under given error probability exponent", (in Russian), 3rd All-Union Conf. on Theory of Information Transmission and Coding, Uzhgorod, Publication house of Uzbek Academy of Sciences, Tashkent, pp. 83-86, 1967.
M. E. Haroutunian and S. A. Tonoyan, "Random coding bound of information hiding E-capacity", Proc. of IEEE Intern. Symp. Infrom. Theory, p. 536, USA, Chicago, 2004.
S. I. Gel'fand and M. S. Pinsker, "Coding for channel with random parameters," Problems of Control and Information Theory, vol. 9, no. 1, pp. 19-31, 1980.
M. E. Haroutunian, "New bounds for E-capacities of arbitrarily varying channel and channel with random parameter" Trans. IIAP NAS RA and YSU, Mathematical Problems of Computer sciences, vol. 22, p. 44-59, 2001.
M. E. Haroutunian, "Bounds of E-capacity for multiple-access channel with random parameter", special book issued in the framework of research project "General Theory of Information Transfer and Combinatorics" at ZiF, Bilefeld University, Germany, 2004.
N. Merhav, " On random coding error exponents of watermarking systems", IEEE Trans. Inform. Theory, vol. 46, no. 2, pp. 420-430, Mar. 2000.
N. Merhav and A. Somekh-Baruch, "On the error exponent and capacity games of private watermarking systems", IEEE Trans. Inform. Theory, vol. 49, no. 3, pp. 537-562, Mar. 2003.
I. Csiszár and J. Körner, Information Theory: Coding theorems for discrete memoryless systems, Academic Press, New York, 1981.
I. Csiszár, "The method of types", IEEE Trans. Inform. Theory, vol. 44, no. 6, pp. 2505-2523, 1998.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
