12 search results - page 2 / 3 » A New Upper Bound on the Capacity of a Class of Primitive Re... |
TIT
2010
12 years 11 months ago
2010
The theory of Markov set-chains is applied to derive upper and lower bounds on the capacity of finite-state channels that are tighter than the classic bounds by Gallager. The new ...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
Abstract--We address the maximum attainable rate of fingerprinting codes under the marking assumption, studying lower and upper bounds on the value of the rate for various sizes of...
CORR
2006
Springer
13 years 4 months ago
2006
Springer
A partially cooperative relay broadcast channel (RBC) is a three-node network with one source node and two destination nodes (destinations 1 and 2) where destination 1 can act as a...
ADHOC
2007
13 years 5 months ago
2007
In this paper, we derive the information theoretic capacity of a special class of mesh networks. A mesh network is a heterogeneous wireless network in which the transmission among...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
—We present a deterministic channel model which captures several key features of multiuser wireless communication. We consider a model for a wireless network with nodes connected...