English
Related papers

Related papers: K-Receiver Wiretap Channel: Optimal Encoding Order…

200 papers

Secrecy capacity of a multiple-antenna wiretap channel is studied in the low signal-to-noise ratio (SNR) regime. Expressions for the first and second derivatives of the secrecy capacity with respect to SNR at SNR = 0 are derived.…

Information Theory · Computer Science 2009-01-21 Mustafa Cenk Gursoy

It is known that a message can be transmitted safely against any wiretapper via a noisy channel without a secret key if the coding rate is less than the so-called secrecy capacity $C_S$, which is usually smaller than the channel capacity…

Information Theory · Computer Science 2007-07-16 Daisuke Kobayashi , Hirosuke Yamamoto , Tomohiro Ogawa

We consider settings in which T multi-antenna transmitters and K single-antenna receivers concurrently utilize the available communication resources. Each transmitter sends useful information only to its intended receivers and can degrade…

Information Theory · Computer Science 2015-10-28 Rami Mochaourab , Eduard Jorswieck

Considering a multiple-user multiple-input multiple-output (MIMO) channel with an eavesdropper, this letter develops a beamformer design to optimize the energy efficiency in terms of secrecy bits per Joule under secrecy quality-of-service…

Information Theory · Computer Science 2017-01-19 Nguyen T. Nghia , Hoang D. Tuan , Trung Q. Duong , H. Vincent Poor

The secrecy capacity problems over the general arbitrarily varying wiretap channel (AVWC), with respect to the maximal decoding error probability and strong secrecy criterion, are considered, where the channel state sequence may be known or…

Information Theory · Computer Science 2017-12-05 Dan He , Yuan Luo

In this paper, we propose a robust transceiver design for the K-pair quasi-static MIMO interference channel. Each transmitter is equipped with M antennas, each receiver is equipped with N antennas, and the k-th transmitter sends L_k…

Information Theory · Computer Science 2010-09-23 Eddy Chiu , Vincent K. N. Lau , Huang Huang , Tao Wu , Sheng Liu

In coding schemes for the wire-tap channel or the broadcast channels with confidential messages, it is well known that the sender needs to use a stochastic encoding to avoid the information about the transmitted confidential message to be…

Information Theory · Computer Science 2012-06-01 Shun Watanabe , Yasutada Oohama

The problem of secure broadcasting with independent secret keys is studied. The particular scenario is analyzed in which a common message has to be broadcast to two legitimate receivers, while keeping an external eavesdropper ignorant of…

Information Theory · Computer Science 2018-02-20 Rafael F. Schaefer , Ashish Khisti , H. Vincent Poor

We study the covert communication over K-user discrete memoryless interference channels (DM-ICs) with a warden. It is assumed that the warden's channel output distribution induced by K "off" input symbols, which are sent when no…

Information Theory · Computer Science 2020-03-11 Kang-Hee Cho , Si-Hyeon Lee

In this paper we consider the problem of secure network coding where an adversary has access to an unknown subset of links chosen from a known collection of links subsets. We study the capacity region of such networks, commonly called…

Information Theory · Computer Science 2013-11-26 Shirin Jalali , Tracey Ho

In this paper, we study a security problem on a simple wiretap network, consisting of a source node S, a destination node D, and an intermediate node R. The intermediate node connects the source and the destination nodes via a set of…

Information Theory · Computer Science 2016-01-18 Fan Cheng , Vincent Y. F. Tan

We study the index coding problem in the presence of an eavesdropper, where the aim is to communicate without allowing the eavesdropper to learn any single message aside from the messages it may already know as side information. We…

Information Theory · Computer Science 2018-09-12 Yuxin Liu , Badri N. Vellambi , Young-Han Kim , Parastoo Sadeghi

This paper presents two different low-complexity methods for obtaining the secrecy capacity of multiple-input multiple-output (MIMO) wiretap channel subject to a sum power constraint (SPC). The challenges in deriving computationally…

Information Theory · Computer Science 2021-02-23 Anshu Mukherjee , Björn Ottersten , Le Nam Tran

This paper studies the achievable rate region of the K-user Gaussian multiple-input single-output interference channel (MISO-IC) with the interference treated as noise, when improper or circularly asymmetric complex Gaussian signaling is…

Information Theory · Computer Science 2013-10-10 Yong Zeng , Rui Zhang , Erry Gunawan , Yong Liang Guan

This paper studies the problem of secure communication over a K-transmitter multiple access channel in the presence of an external eavesdropper, subject to a joint secrecy constraint (i.e., information leakage rate from the collection of K…

Information Theory · Computer Science 2017-01-24 Yanling Chen , O. Ozan Koyluoglu , A. J. Han Vinck

Multiple-input multiple-output (MIMO) or multi-antenna communication is a key technique to achieve high spectral efficiency in wireless systems. For the point-to-point MIMO channel, it is a well-known result that the channel singular value…

Information Theory · Computer Science 2016-11-17 Liang Liu , Rui Zhang

In this work, we consider a K-user Gaussian wiretap multiple-access channel (GW-MAC) in which each transmitter has an independent confidential message for the receiver. There is also an external eavesdropper who intercepts the…

Information Theory · Computer Science 2015-10-06 Parisa Babaheidarian , Somayeh Salimi , Panos Papadimitratos

This work investigates the secrecy capacity of the Wiretap Broadcast Channel (WBC) with an external eavesdropper where a source wishes to communicate two private messages over a Broadcast Channel (BC) while keeping them secret from the…

Information Theory · Computer Science 2015-08-21 Meryem Benammar , Pablo Piantanida

In this paper, we propose a signal-aligned network coding (SNC) scheme for K-user time-varying multiple-input multiple-output (MIMO) interference channels with limited receiver cooperation. We assume that the receivers are connected to a…

Information Theory · Computer Science 2023-03-22 Tse-Tin Chan , Tat-Ming Lok

In this paper, we investigate the secrecy performance of stochastic MIMO wireless networks over small-scale $\alpha$-$\mu$ fading channels, where both the legitimate receivers and eavesdroppers are distributed with two independent…

Information Theory · Computer Science 2018-10-03 Long Kong , Satyanarayana Vuppala , Georges Kaddoum
‹ Prev 1 4 5 6 7 8 10 Next ›