1031 search results - page 65 / 207 » The single-serving channel capacity |
CCS
2009
ACM
15 years 11 months ago
2009
ACM
There is a natural intuitive match between anonymity and information theory. In particular, the maximal anonymity loss in anonymity protocols can be matched to the information the...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We study the best known general inner bound[1] and outer bound[2] for the capacity region of the two user discrete memory less channel. We prove that a seemingly stronger outer bou...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
—This paper addresses three issues in the field of ad hoc network capacity: the impact of i) channel fading, ii) channel inversion power control, and iii) threshold–based sche...
ICC
2008
IEEE
15 years 5 months ago
2008
IEEE
—The cooperative dirty paper coding (DPC) rate region is investigated in a two-transmitter two-receiver network with full channel state information available at all terminals. Th...
106
click to vote
SECON
2007
IEEE
15 years 5 months ago
2007
IEEE
— In this paper we study the broadcast capacity of multihop wireless networks which we define as the maximum rate at which broadcast packets can be generated in the network such...