@misc{Haroutunian_Mariam_Random,
 author={Haroutunian, Mariam and Tonoyan, Smbat and Oleksiy Koval and Svyatoslav Voloshynovskiy},
 howpublished={online},
 publisher={Изд-во НАН РА},
 abstract={In this paper we consider the problem of reversible information hiding in the case when the attacker uses only discrete memoryless channels (DMC), the decoder knows only the class of channels, but not the DMC chosen by the attacker, the attacker knows the information-hiding strategy, probability distributions of all random variables, but not the side information. We introduce the notion of reversible information hiding E-capacity, which expresses the dependence of the information hiding rate on the error probability exponent and the distortion levels for information hider, for attacker and for the host data approximation. The random coding bound for reversible information hiding E-capacity is found. When E ! 0 we obtain the lower bound for reversibility information hiding capacity. In particular, we have analyzed two special cases of the general problem formulation, pure reversibility and pure message communications.},
 type={Հոդված},
 title={Random coding bound of reversible information hiding E-capacity},
 keywords={Mathematics},
}