Zobrazeno 1 - 10
of 2 917
pro vyhledávání: '"Capacity theorems"'
In index coding, a server broadcasts multiple messages to their respective receivers, each with some side information that can be utilized to reduce the amount of communication from the server. Distributed index coding is an extension of index coding
Externí odkaz:
http://arxiv.org/abs/1801.09063
Autor:
Kim, Hyeji, Gamal, Abbas El
We establish the capacity region of several classes of broadcast channels with random state in which the channel to each user is selected from two possible channel state components and the state is known only at the receivers. When the channel compon
Externí odkaz:
http://arxiv.org/abs/1509.04335
Autor:
Sharma, Naresh, Warsi, Naqueeb Ahmad
A unified approach to prove the converses for the quantum channel capacity theorems is presented. These converses include the strong converse theorems for classical or quantum information transfer with error exponents and novel explicit upper bounds
Externí odkaz:
http://arxiv.org/abs/1205.1712
Autor:
Nazer, Bobak, Gastpar, Michael
Random coding arguments are the backbone of most channel capacity achievability proofs. In this paper, we show that in their standard form, such arguments are insufficient for proving some network capacity theorems: structured coding arguments, such
Externí odkaz:
http://arxiv.org/abs/0802.0342
In this paper, we obtain a general achievable rate region and some certain capacity theorems for multiple-access relay channel (MARC), using decode and forward (DAF) strategy at the relay, superposition coding at the transmitters. Our general rate re
Externí odkaz:
http://arxiv.org/abs/1108.3365
Autor:
Farsani, Reza K., Ebrahimpour, Reza
As a brain inspired wireless communication scheme, cognitive radio is a novel approach to promote the efficient use of the scarce radio spectrum by allowing some users called cognitive users to access the under-utilized spectrum licensed out to the p
Externí odkaz:
http://arxiv.org/abs/1207.5040
Autor:
Liang, Ruchen Duan Yingbin
A class of cognitive interference channel with state is investigated, in which two transmitters (transmitters 1 and 2) communicate with two receivers (receivers 1 and 2) over an interference channel. The two transmitters jointly transmit a common mes
Externí odkaz:
http://arxiv.org/abs/1207.0016
Autor:
Zahavi, Daniel, Dabora, Ron
Handling interference is one of the main challenges in the design of wireless networks. One of the key approaches to interference management is node cooperation, which can be classified into two main types: relaying and feedback. In this work we cons
Externí odkaz:
http://arxiv.org/abs/1104.4308
Publikováno v:
Proceedings of the 2010 IEEE International Sysmposium on Information Theory (ISIT 2010), Austin, USA, pp. 664-668, June 13-18, 2010
The L-user additive white Gaussian noise multi-way relay channel is considered, where multiple users exchange information through a single relay at a common rate. Existing coding strategies, i.e., complete-decode-forward and compress-forward are show
Externí odkaz:
http://arxiv.org/abs/1004.2300
Autor:
Rohit Kumar Verma
Publikováno v:
Asian Journal of Probability and Statistics. 22:1-7
The capacity for which the value or is its lower bound is referred to as the optimal channel capacity. Through this communication, we attempt to study the additive Gaussian interference that arises from the Gaussian channel's two-sided state informat