# On Random Coding Bound for E-capacity Region of the Broadcast Channel With Confidential Messages

## Abstract

The information theoretic security recently has attracted much attention [8]. One of the important objects in the secure communication is the broadcast channel with confidential messages (BCC) first investigated by Csiszár and Körner [1]. The model is depicted in Fig.1. The BCC involves two discrete memoryless channels with two sources, one encoder and two receivers. A common message must be transmitted at rate *R*_{0} to both receivers and a private message to the intended receiver at rate *R*_{1} while keeping the other receiver ignorant of it with equivocation rate *R*_{e}.

## References

I.Csiszár and J. Körner, “Broadcast channel with confidential messages", IEEE Trans. Inf. Theory, vol. IT-24, no. 3, pp. 339-348, 1978.

I. Csiszár and J. Körner, “Information Theory: Coding Theorems for Discrete Memoryless Systems", New York, Wiley, 1981.

E.A. Haroutunian, “Upperestimate of transmission rate for memoryless channel with countable number of output signals under given error probability exponent", 3rd All Union Conference on Theory of Information Transmission and Coding, Uzhgorod, Publishing House of the Uzbek Academy of Sciences, pp. 83-86, 1967.

E.A. Haroutunian, B. Belbashir, “Lower bound of the optimal transmission rate depending on given error probability exponent for discrete memoryless channel and for asymmetric broadcast channel", Abstracts of Papers of 6th Int. Symp. Inf. Theory, Tashkent, USSR, vol. 1, pp. 19-21, 1984.

E.A. Haroutunian, “On Bounds for E-Capacity of DMC", IEEE Trans. Inf. Theory, vol. IT-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, nos. 2-3, 2008.

M.E. Haroutunian, “Random coding bound for E-capacity region of the broadcast channel", Mathematical Problems of Computer Science, no. 21, pp. 50-60, 2000.

Y. Liang, H.V. Poor and S. Shamai, “Information theoretic security", Foundations and Trends in Communications and Information Theory, vol. 5, nos. 4-5, 2009.

R. Liu, I. Maric, P. Spasojevic and R. Yates, “Discrete memoryless interference and broadcast channels with confidential messages: secrecy rate regions", IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2493-2507, 2008.

A.D. Wyner, “The wire-tap channel", Bell Syst. Tech. J., vol. 54, no. 8, pp. 1355-1387, 1975.

J. Xu, Y. Cao and B. Chen, “Capacity bound for broadcast channels with confidential messages", IEEE Trans. Inf. Theory, vol. 55, no. 10, pp. 4529-4542, 2009.

## Downloads

## Published

## How to Cite

*Mathematical Problems of Computer Science*,

*38*, 34–36. Retrieved from http://mpcs.sci.am/index.php/mpcs/article/view/478

## Issue

## Section

## License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.