English
Related papers

Related papers: Secure Communications for the Two-user Broadcast C…

200 papers

Harnessing a block-sparse prior to recover signals through underdetermined linear measurements has been extensively shown to allow exact recovery in conditions where classical compressed sensing would provably fail. We exploit this result…

Information Theory · Computer Science 2021-10-12 Maxime Ferreira Da Costa , Urbashi Mitra

This paper considers the single antenna, static Gaussian broadcast channel in the finite blocklength regime. Second order achievable and converse rate regions are presented. Both a global reliability requirement and per-user reliability…

Information Theory · Computer Science 2022-10-03 Daniela Tuninetti , Paul Sheldon , Besma Smida , Natasha Devroye

In this paper we study the impact of a relay node in a two-user network. We assume a random access collision channel model with erasures. In particular we obtain an inner and an outer bound for the stability region.

Information Theory · Computer Science 2016-11-15 Nikolaos Pappas , Marios Kountouris , Anthony Ephremides , Apostolos Traganitis

In this paper, a class of broadcast interference channels (BIC) is investigated, where one of the two broadcast receivers is subject to interference coming from a point-to-point transmission. For a general discrete memoryless broadcast…

Information Theory · Computer Science 2015-08-04 Yuanpeng Liu , Elza Erkip

This paper considers multiple-input multiple-output (MIMO) full-duplex (FD) two-way secrecy systems. Specifically, both multi-antenna FD legitimate nodes exchange their own confidential message in the presence of an eavesdropper. Taking…

Information Theory · Computer Science 2017-05-18 Zheng Chu , Tuan Anh Le , Huan X. Nguyen , Arumugam Nallanathan , Mehmet Karamanoglu

This paper studies the secure beamforming design in a multiple-antenna three-node system where two source nodes exchange messages with the help of an untrusted relay node. The relay acts as both an essential signal forwarder and a potential…

Information Theory · Computer Science 2015-06-18 Jianhua Mo , Meixia Tao , Yuan Liu , Rui Wang

In this work, we propose a covert communication scheme where the transmitter attempts to hide its transmission to a full-duplex receiver, from a warden that is to detect this covert transmission using a radiometer. Specifically, we first…

Information Theory · Computer Science 2017-11-13 Jinsong Hu , Khurram Shahzad , Shihao Yan , Xiangyun Zhou , Feng Shu , Jun Li

In this paper we consider the robust secure beamformer design for MISO wiretap channels. Assume that the eavesdroppers' channels are only partially available at the transmitter, we seek to maximize the secrecy rate under the transmit power…

Information Theory · Computer Science 2013-10-29 Shuai Ma , Mingyi Hong , Enbin Song , Xiangfeng Wang , Dechun Sun

The communication scenario under consideration in this paper corresponds to a multiuser channel with side information and consists of a broadcast channel with two legitimate receivers and an eavesdropper. Mainly, the results obtained are as…

Information Theory · Computer Science 2012-10-24 Maël Le Treust , Abdellatif Zaidi , Samson Lasaulce

Backscatter communication (BC) has emerged as a pivotal wireless communication paradigm owing to its low-power and cost-effective characteristics. However, BC faces various challenges from its low signal detection rate to its security…

Information Theory · Computer Science 2024-10-04 Masoud Kaveh , Farshad Rostami Ghadi , Zhao Li , Zheng Yan , Riku Jantti

We introduce a method for securely delivering a set of messages to a group of clients over a broadcast erasure channel where each client is interested in a distinct message. Each client is able to obtain its own message but not the others'.…

Information Theory · Computer Science 2013-05-08 Shahriar Etemadi Tajbakhsh , Parastoo Sadeghi , Rodney Kennedy

The two-user Gaussian interference channel with a shared out-of-band relay is considered. The relay observes a linear combination of the source signals and broadcasts a common message to the two destinations, through a perfect link of fixed…

Information Theory · Computer Science 2016-11-18 Peyman Razaghi , Song Nam Hong. Lei Zhou , Wei Yu , Giuseppe Caire

This paper applies Information Theoretic analysis to packet-based random multiple access communication systems. A new channel coding approach is proposed for coding within each data packet with built-in support for bursty traffic…

Information Theory · Computer Science 2016-11-17 Jie Luo , Anthony Ephremides

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers via a Gaussian MIMO broadcast channel. A wire-tapper also receives the transmitted signal via another MIMO…

Information Theory · Computer Science 2009-10-19 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

We study the energy performance of random linear network coding for time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data…

Information Theory · Computer Science 2009-01-05 Daniel E. Lucani , Milica Stojanovic , Muriel Médard

This work considers a layered coding approach for efficient transmission of data over a wireless block fading channel without transmitter channel state information (CSI), which is connected to a limited capacity reliable link, known as the…

Information Theory · Computer Science 2020-05-01 Avi Steiner , Shlomo Shamai

In this paper, we study capacity bounds for discrete memoryless broadcast channels with confidential messages. Two private messages as well as a common message are transmitted; the common message is to be decoded by both receivers, while…

Information Theory · Computer Science 2016-11-17 Jin Xu , Yi Cao , Biao Chen

In this paper, we study cooperative cognitive radio networks consisting of a primary user and multiple secondary users. Secondary users transmit only when primary user is sensed as silent and may interfere with primary transmission due to…

Information Theory · Computer Science 2016-08-25 Kedar Kulkarni , Adrish Banerjee

We consider a two-relay network in which a source aims to communicate a confidential message to a destination while keeping the message secret from the relay nodes. In the first hop, the channels from the source to the relays are assumed to…

Information Theory · Computer Science 2014-10-21 Y. Ozan Basciftci , C. Emre Koksal

The problem of two-sender unicast index coding consists of two senders and a set of receivers. Each receiver demands a unique message and possesses some of the messages demanded by other receivers as its side-information. Every demanded…

Information Theory · Computer Science 2019-02-14 Chinmayananda Arunachala , Vaneet Aggarwal , B. Sundar Rajan