Loading...

Random coding bound for E-capacity region of the relay channel with confidential messages

Afshar, N ; Sharif University of Technology

487 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/IWCIT.2014.6842481
  3. Abstract:
  4. 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
  5. Keywords:
  6. Effective rate ; Error probability exponent ; Relay channel with confidential messages ; Communication ; Electric relays ; Confidential message ; E-capacity ; Equivocation rates ; Error probabilities ; Method of types ; Channel capacity
  7. Source: IWCIT 2014 - Iran Workshop on Communication and Information Theory ; May , 2014 ; 978-1-4799-4878-9
  8. URL: http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6842481&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Fabs_all.jsp%3Farnumber%3D6842481