Lower Bound for E Capacity of Discrete Memoryless Channel with Two-Sided State Information

Authors

  • Mariam E. Haroutunian Institute for Informatics and Automation Problems of NAS RA
  • Arthur R. Muradyan Institute for Informatics and Automation Problems of NAS RA

Abstract

We study the channel with two-sided state information, a discrete memoryless channel
with finite input and output alphabets and random state sequence. Partial information about the state sequence is available to the encoder and decoder. Applications of this study include watermarking, data hiding, communication in presence of partially
known interferers. The capacity of this model was obtained by Cover and Chiang in [1]. In this paper the random coding bound of E-capacity is derived for considered model which can be called also generalized channel with state information, as it includes four possible situations of the channel with random parameter.

References

T.M. Cover and M. Chiang, “Duality between channel capacity and rate distortion with two-sided state information", IEEE Transactions on Information Theory, vol. 48, no. 6, pp. 1629-1638, 2002.

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.

C.E. Shannon, “Channels with side information at the transmitter", IBMJ. Res, Develop, vol. 2, pp. 289-293, 1958.

C. Heegard and A.A. El Gamal, “On the capacity of computer memory with defects", IEEE Transactions on Information Theory, vol. IT-29, no. 5, pp. 731-739, 1983.

M. Costa, “Writing on dirty paper", IEEE Transactions on Information Theory, vol. 29, no. 3, pp. 439-441, 1983.

P. Moulin and J.A. O'Sullivan, “Information-theoretic analysis of information hiding", IEEE Transactions on Information Theory, vol. 49, no. 3, pp. 563-593, Mar. 2003.

P. Moulin and Y. Wang, “Capacity and random-coding exponents for channel coding with side information", IEEE Transactions on Information Theory, vol. 53, no. 4, pp. 1326-1347, 2007.

E.A. Haroutunian, “On bounds for E-capacity of DMC", IEEE Transactions on Information Theory, vol. 53, no. 11, pp. 4210-4220, 2007.

E.A. Haroutunian, M.E. Haroutunian and A.N.Harutyunyan, “Reliability criteria in information theory and in statistical hypothesis testing", Foundations and Trends in Communications and Information Theory, vol. 4, no 2-3, pp. 97-263, 2008.

M.E. Haroutunian, “Newbounds for E-capacities of arbitrarily varying channel and channel with random parameter", Transactions of the Institute for Informatics and Automation Problems of the NAS of RA, Mathematical Problems of Computer Sciences, vol. 22, pp. 44-59, 2001.

M.E. Haroutunian, “Estimates of E-capacity and capacity regions for multiple-access channel with random parameter", Lecture Notes in Computer Science, vol. 4123, Springer Verlag, pp. 196-217, 2006.

M.E. Haroutunian and S.A.Tonoyan, “Random coding bound of information hiding E-capacity", Proc. of IEEE International Symposium on Information 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 Science, vol. 23, pp. 20-31, 2004.

T.M. Cover and J.A. Thomas, Elements of Information Theory, Wiley, New York, 1991.

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 Transactions on Information Theory, vol. 44, no. 6, pp. 2505-2523, 1998.

Downloads

Published

2008-09-25

How to Cite

Haroutunian, M. E. ., & Muradyan, A. R. . (2008). Lower Bound for E Capacity of Discrete Memoryless Channel with Two-Sided State Information. Mathematical Problems of Computer Science, 31, 28–39. Retrieved from https://mpcs.sci.am/index.php/mpcs/article/view/389

Most read articles by the same author(s)

1 2 > >>