Title :
Random coding bound for E-capacity region of the relay channel with confidential messages
Author :
Afshar, Nasrin ; Akhbari, Bahareh ; Aref, Mohammad Reza
Author_Institution :
Inf. Syst. & Security Lab. (ISSL), Sharif Univ. of Technol., Tehran, Iran
Abstract :
We study a relay channel with confidential messages (RCC), which involves a sender, a receiver and a relay. In the RCC, a common information must be transmitted to both a receiver and a relay and also a private information to the intended receiver, while keeping the relay as ignorant of it as possible. The level of ignorance of the relay rather than the private message is measured by the equivocation rate. We consider two error probability exponents (reliabilities) E1, E2 of exponentially decrease of error probability of the receiver decoder and the relay decoder, respectively. For E = (E1, E2), the E-capacity region is the set of all E-achievable rates of codes with given reliability E. We derive a random coding bound for E-capacity region of the RCC using block Markov strategies over a fixed number of blocks. We also show that, when E tends to zero, our obtained inner bound for E-capacity region converges to the inner bound for the capacity region of the RCC obtained by Y. Oohama and S. Watanabe.
Keywords :
Markov processes; codecs; error statistics; radio receivers; random codes; telecommunication channels; E-achievable rates; E-capacity region; block Markov strategies; confidential messages; equivocation rate; error probability; random coding bound; receiver decoder; relay channel; relay decoder; Channel coding; Decoding; Error probability; Receivers; Relays; Vectors; E-capacity; effective rate; equivocation rate; error probability exponent; method of types; relay channel with confidential messages;
Conference_Titel :
Communication and Information Theory (IWCIT), 2014 Iran Workshop on
Conference_Location :
Tehran
Print_ISBN :
978-1-4799-4878-9
DOI :
10.1109/IWCIT.2014.6842481