English
Related papers

Related papers: Carbon Copying Onto Dirty Paper

200 papers

The problem of Dirty Paper Coding (DPC) over the Fading Dirty Paper Channel (FDPC) Y = H(X + S)+Z, a more general version of Costa's channel, is studied for the case in which there is partial and perfect knowledge of the fading process H at…

Information Theory · Computer Science 2009-01-20 Chinmay S. Vaze , Mahesh K. Varanasi

This paper investigates information-theoretic oblivious transfer via a discrete memoryless broadcast channel with one sender and two receivers. We analyze both non-colluding and colluding honest-but-curious user models and establish general…

Information Theory · Computer Science 2025-10-30 Hadi Aghaee , Christian Deppe , Holger Boche

We consider the capacity of an energy harvesting communication channel with a finite-sized battery. As an abstraction of this problem, we consider a system where energy arrives at the encoder in multiples of a fixed quantity, and the…

Information Theory · Computer Science 2013-05-20 Kaya Tutuncuoglu , Omur Ozel , Aylin Yener , Sennur Ulukus

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

We introduce the notion of distributed quantum dense coding, i.e. the generalization of quantum dense coding to more than one sender and more than one receiver. We show that global operations (as compared to local operations) of the senders…

We study information-theoretic security for discrete memoryless interference and broadcast channels with independent confidential messages sent to two receivers. Confidential messages are transmitted to their respective receivers with…

Information Theory · Computer Science 2016-11-15 Ruoheng Liu , Ivana Maric , Predrag Spasojevic , Roy D. Yates

A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special cases of physically degraded channels and unidirectional…

Information Theory · Computer Science 2016-11-18 O. Simeone , D. Gunduz , H. V. Poor , A. Goldsmith , S. Shamai

In this paper, we study resource allocation algorithm design for power efficient secure communication with simultaneous wireless information and power transfer (WIPT) in multiuser communication systems. In particular, we focus on power…

Information Theory · Computer Science 2014-02-25 Shiyang Leng , Derrick Wing Kwan Ng , Robert Schober

We analyze deterministic message identification via channels with non-discrete additive white noise and with a noiseless feedback link under both average power and peak power constraints. The identification task is part of Post Shannon…

Information Theory · Computer Science 2022-02-18 Moritz Wiese , Wafa Labidi , Christian Deppe , Holger Boche

We consider a cognitive radio network scenario where a primary transmitter and a secondary transmitter, respectively, communicate a message to their respective primary receiver and secondary receiver over a packet-based wireless link, using…

Information Theory · Computer Science 2015-12-11 Nan Li , Lars K. Rasmussen , Ming Xiao

In conventional communication systems, any interference between two communicating points is regarded as unwanted noise since it distorts the received signals. On the other hand, allowing simultaneous transmission and intentionally accepting…

Information Theory · Computer Science 2022-08-02 Ufuk Altun , Gunes Karabulut Kurt , Enver Ozdemir

In this paper, first, we investigate the model of degraded broadcast channel with side information and confidential messages. This work is from Steinberg's work on the degraded broadcast channel with causal and noncausal side information,…

Information Theory · Computer Science 2016-11-17 Bin Dai , A. J. Han Vinck , Zhuojun Zhuang , Yuan Luo

In many wireless communication systems, radios are subject to a duty cycle constraint, that is, a radio only actively transmits signals over a fraction of the time. For example, it is desirable to have a small duty cycle in some low power…

Information Theory · Computer Science 2012-09-24 Lei Zhang , Hui Li , Dongning Guo

We study the MIMO broadcast channel and compare the achievable throughput for the optimal strategy of dirty paper coding to that achieved with sub-optimal and lower complexity linear precoding (e.g., zero-forcing and block diagonalization)…

Information Theory · Computer Science 2016-11-17 Juyul Lee , Nihar Jindal

We study achievable rates of reliable communication in a power-constrained two-way additive interference channel over the real alphabet where communication is disrupted by a power-constrained jammer. This models the wireless communication…

Information Theory · Computer Science 2020-01-10 Yihan Zhang , Shashank Vatedka , Sidharth Jaggi

The growing need for reliable communication over untrusted networks has caused a renewed interest in adversarial channel models, which often behave much differently than traditional stochastic channel models. Of particular practical use is…

Information Theory · Computer Science 2021-04-16 Vinayak Suresh , Eric Ruzomberka , David J. Love

The rapid growth of data volume and the accompanying congestion problems over the wireless networks have been critical issues to content providers. A novel technique, termed as coded cache, is proposed to relieve the burden. Through…

Networking and Internet Architecture · Computer Science 2015-04-08 Wei Huang , Sinong Wang , Lianghui Ding , Feng Yang , Wenjun Zhang

We study the role of caches in wireless interference networks. We focus on content caching and delivery across a Gaussian interference network, where both transmitters and receivers are equipped with caches. We provide a constant-factor…

Information Theory · Computer Science 2019-01-08 Jad Hachem , Urs Niesen , Suhas Diggavi

We identify the common underlying form of the capacity expression that is applicable to both cases where causal or non-causal side information is made available to the transmitter. Using this common form we find that for the single user…

Information Theory · Computer Science 2007-07-13 Syed A. Jafar

We develop and analyze new cooperative strategies for ad hoc networks that are more spectrally efficient than classical DF cooperative protocols. Using analog network coding, our strategies preserve the practical half-duplex assumption but…

Information Theory · Computer Science 2007-07-13 Nadia Fawaz , David Gesbert , Merouane Debbah
‹ Prev 1 8 9 10 Next ›