Sciweavers

41 search results - page 5 / 9
» Capacity Achieving LDPC Codes Through Puncturing
Sort
View
ICC
2007
IEEE
105views Communications» more  ICC 2007»
14 years 1 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
PRL
2007
107views more  PRL 2007»
13 years 6 months ago
Robust SS watermarking with improved capacity
Robustness is a key attribute of spread spectrum (SS) watermarking scheme. It is significantly deteriorated if one tries to achieve high embedding rate keeping other parameters u...
Santi P. Maity, Malay K. Kundu, Tirtha S. Das
TIT
2010
111views Education» more  TIT 2010»
13 years 2 months ago
Directly lower bounding the information capacity for channels with I.I.D.deletions and duplications
We directly lower bound the information capacity for channels with i.i.d. deletions and duplications. Our approach differs from previous work in that we focus on the information ca...
Adam Kirsch, Eleni Drinea
MOBIHOC
2007
ACM
14 years 7 months ago
Bounds for the capacity of wireless multihop networks imposed by topology and demand
Existing work on the capacity of wireless networks predominantly considers homogeneous random networks with random work load. The most relevant bounds on the network capacity, e.g...
Alireza Keshavarz-Haddad, Rudolf H. Riedi
CISS
2007
IEEE
14 years 1 months ago
High-Throughput Cooperative Communications with Complex Field Network Coding
Relay-based cooperative communications can achieve spatial diversity gains, enhance coverage and potentially increase capacity. If considered for large networks, traditional relayi...
Tairan Wang, Georgios B. Giannakis