English
Related papers

Related papers: Multiple Access Channels with Generalized Feedback…

200 papers

In this paper, the multiple access channel (MAC) with channel state is analyzed in a scenario where a) the channel state is known non-causally to the transmitters and b) there is perfect causal feedback from the receiver to the…

Information Theory · Computer Science 2007-07-13 Wei Wu , Sriram Vishwanath , Ari Arapostathis

A multiple transmit antenna, single receive antenna (per receiver) downlink channel with limited channel feedback is considered. Given a constraint on the total system-wide channel feedback, the following question is considered: is it…

Information Theory · Computer Science 2007-10-09 Niranjay Ravindran , Nihar Jindal

In this paper, we propose a cooperative approach to improve the security of both primary and secondary systems in cognitive radio multicast communications. During their access to the frequency spectrum licensed to the primary users, the…

Information Theory · Computer Science 2017-07-11 Van-Dinh Nguyen , Trung Q. Duong , Oh-Soon Shin , Arumugam Nallanathan , George K. Karagiannidis

We consider problems of two-user secret key generation through an intermediate relay. Each user observes correlated source sequences and communicates to the relay over rate-limited noiseless links. The relay processes and broadcasts…

Information Theory · Computer Science 2016-07-27 Kittipong Kittichokechai , Rafael F. Schaefer , Giuseppe Caire

In this work, we derive achievable rate regions for the three-user interference channels with asymmetric transmitter cooperation and various decoding capabilities at the receivers. The three-user channel facilitates different ways of…

Information Theory · Computer Science 2011-02-23 K. G. Nagananda , Chandra R. Murthy

This paper presents further insights into a recently developed round-trip communication scheme called ``Secret-message Transmission by Echoing Encrypted Probes (STEEP)''. A legitimate wireless channel between a multi-antenna user (Alice)…

Information Theory · Computer Science 2025-07-21 Yingbo Hua , Md Saydur Rahman

In this paper, we consider the secrecy capacity of a wiretap channel in the presence of causal state information and secure rate-limited feedback. In this scenario, the causal state information from the channel is available to both the…

Information Theory · Computer Science 2014-08-15 Alejandro Cohen , Asaf Cohen

We consider a secure communication scenario through the two-user Gaussian interference channel: each transmitter (user) has a confidential message to send reliably to its intended receiver while keeping it secret from the other receiver.…

Information Theory · Computer Science 2016-04-26 Parisa Babaheidarian , Somayeh Salimi , Panos Papadimitratos

Wireless communication is susceptible to eavesdropping attacks because of its broadcast nature. This paper illustrates how interference can be used to counter eavesdropping and assist secrecy. In particular, a wire-tap channel with a…

Information Theory · Computer Science 2016-11-18 Xiaojun Tang , Ruoheng Liu , Predrag Spasojevic , H. Vincent Poor

Fundamental limits of secret-key agreement over reciprocal wireless channels are investigated. We consider a two-way block-fading channel where the channel gains in the forward and reverse links between the legitimate terminals are…

Information Theory · Computer Science 2012-11-08 Ashish Khisti

For information transmission a binary symmetric channel is used. There is also another noisy binary symmetric channel (feedback channel), and the transmitter observes without delay all the outputs of the forward channel via that feedback…

Information Theory · Computer Science 2010-11-10 M. V. Burnashev , H. Yamamoto

We consider a discrete memoryless broadcast channel consists of two users and a sender. The sender has two independent confidential messages for each user. We extend the work of Liu et al.\ on broadcast channels with two confidential…

Information Theory · Computer Science 2016-02-02 Igor Bjelakovic , Jafar Mohammadi , Sławomir Stańczak

We investigate the maximum coding rate achievable on a two-user broadcast channel for the case where a common message is transmitted with feedback using either fixed-blocklength codes or variable-length codes. For the fixed-blocklength-code…

Information Theory · Computer Science 2018-09-03 Kasper Fløe Trillingsgaard , Wei Yang , Giuseppe Durisi , Petar Popovski

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

Achievable rate regions for cooperative relay broadcast channels with rate-limited feedback are proposed. Specifically, we consider two-receiver memoryless broadcast channels where each receiver sends feedback signals to the transmitter…

Information Theory · Computer Science 2016-05-09 Youlong Wu

We consider a scenario in which $K$ transmitters attempt to communicate covert messages reliably to a legitimate receiver over a discrete memoryless MAC while simultaneously escaping detection from an adversary who observes their…

Information Theory · Computer Science 2019-06-11 Keerthi Suria Kumar Arumugam , Matthieu R. Bloch

We consider the problem of finding secrecy rate of a multiple-input multiple-output (MIMO) wire-tap channel. A transmitter, a legitimate receiver, and an eavesdropper are all equipped with multiple antennas. The channel states from the…

Information Theory · Computer Science 2014-11-04 Arash Khabbazibasmenj , Maksym A. Girnyk , Sergiy A. Vorobyov , Mikko Vehkaperä , Lars K. Rasmussen

A mechanism called switched feedback is introduced; under switched feedback, each channel output goes forward to the receiver(s) or back to the transmitter(s) but never both. By studying the capacity of the Multiple-Access Channel (MAC)…

Information Theory · Computer Science 2025-05-01 Oliver Kosut , Michael Langberg , Michelle Effros

We consider a communication system where a relay helps transmission of messages from {a} sender to {a} receiver. The relay is considered not only as a helper but as a wire-tapper who can obtain some knowledge about transmitted messages. In…

Information Theory · Computer Science 2010-10-01 Yasutada Oohama , Shun Watanabe

Secrecy in communication systems is measured herein by the distortion that an adversary incurs. The transmitter and receiver share secret key, which they use to encrypt communication and ensure distortion at an adversary. A model is…

Information Theory · Computer Science 2015-04-14 Curt Schieler , Paul Cuff