Loading...
Search for: equivocation-rates
0.008 seconds

    On the achievable rate region of a new Gaussian wiretap channel with side information

    , Article 2012 IEEE Information Theory Workshop, ITW 2012, 3 September 2012 through 7 September 2012 ; September , 2012 , Pages 657-661 ; 9781467302234 (ISBN) Bafghi, H. G ; Seyfe, B ; Mirmohseni, M ; Aref, M. R ; Sharif University of Technology
    2012
    Abstract
    This paper introduces a new applicable Gaussian wiretap channel with side information. In this channel, the state of the channel to the wiretapper is separated from the main channel's one. It means that the legitimate receiver and the wiretapper are listening to the transmitted signal through the different channels with different channel states which may have some correlation to each other. The state of the main channel, is assumed to be known at the transmitter, helps the sender to encrypt its messages. The achievable equivocation-rate region for this model is drived in the Gaussian case and the results are reduced to the previous works as special cases  

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

    , Article IWCIT 2014 - Iran Workshop on Communication and Information Theory ; May , 2014 ; 978-1-4799-4878-9 Afshar, N ; Akhbari, B ; Aref, M. R ; Sharif University of Technology
    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... 

    On the secrecy of the cognitive interference channel with partial channel states

    , Article Transactions on Emerging Telecommunications Technologies ; Volume 27, Issue 11 , 2016 , Pages 1472-1485 ; 21615748 (ISSN) Bafghi, H. G ; Seyfe, B ; Mirmohseni, M ; Aref, M. R ; Sharif University of Technology
    Wiley Blackwell  2016
    Abstract
    The secrecy problem in the state-dependent cognitive interference channel is considered in this paper. In our model, there are a primary and a secondary (cognitive) transmitter–receiver pairs, in which the cognitive transmitter has the message of the primary one as side information. In addition, the channel is affected by two channel state sequences, which are known at the cognitive transmitter and the corresponding receiver, separately. The cognitive transmitter should cooperate with the primary one, and it wishes to keep its message secure at the primary receiver. The achievable equivocation-rate regions for this channel are derived using two approaches: the binning scheme coding and...