Computation of Information Hiding Capacity and E-Capacity Lower Bounds
Abstract
The binary{Hamming case of the E-capacity and capacity results for information hiding system [1, 2] is evaluated for practical interests. A special parallel algorithm is elaborated and the computational software utilities are developed. The graphs, describing dependences of information hiding rate from the reliability and allowed distortion levels for the information hider and the attacker are obtained and presented. Also the graphical view of the capacity, depending from the allowed distortion levels is plotted.
References
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.
M. E. Haroutunian and S.A .Tonoyan,"On estimates of rate-reliability-distortion function for information hiding system" , Transactions of the Institute for Informatics and Automation Problems of the NAS of RA. Mathematical Problems of Computer Scence 23, pp. 20-31 , 2004.
P. Moulin and J. A . O'Sullivan, " Information-theoretic analysis of information hiding", EEE Trans. Inform. Theory, vol. 49, no. 3, pp. 5 63-593, Mar. 2003.
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.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
