Sciweavers

225 search results - page 1 / 45
» Capacity Bounds for Sticky Channels
Sort
View
TIT
2008
84views more  TIT 2008»
13 years 4 months ago
Capacity Bounds for Sticky Channels
The capacity of sticky channels, a subclass of insertion channels where each symbol may be duplicated multiple times, is considered. The primary result is to provide nearly tight n...
Michael Mitzenmacher
TIT
2010
76views Education» more  TIT 2010»
12 years 11 months ago
Tighter bounds on the capacity of finite-state channels via Markov set-chains
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 ...
Jun Chen, Haim H. Permuter, Tsachy Weissman
ICC
2007
IEEE
105views Communications» more  ICC 2007»
13 years 11 months ago
Lower Bounds on the Capacity Regions of the Relay Channel and the Cooperative Relay-Broadcast Channel with Non-Causal Side Infor
— In this work, coding for the relay channel (RC) and the cooperative relay broadcast channel (RBC) controlled by random parameters are studied. In the first channel, the RC, in...
Abdellatif Zaidi, Luc Vandendorpe, Pierre Duhamel
CISS
2008
IEEE
13 years 7 months ago
Outer bound and noisy-interference sum-rate capacity for symmetric Gaussian interference channels
A new outer bound on the capacity region of Gaussian interference channels is developed. The bound combines and improves existing genie-aided methods and is shown to give the sum-r...
Xiaohu Shang, Gerhard Kramer, Biao Chen
CORR
2008
Springer
86views Education» more  CORR 2008»
13 years 5 months ago
Capacity Regions and Bounds for a Class of Z-interference Channels
We define a class of Z-interference channels for which we obtain a new upper bound on the capacity region. The bound exploits a technique first introduced by Korner and Marton. A ...
Nan Liu, Andrea J. Goldsmith