Sciweavers

1665 search results - page 135 / 333
» On Quiescent Reliable Communication
Sort
View
TIT
2002
89views more  TIT 2002»
13 years 9 months ago
Upper bounds on the rate of LDPC Codes
We derive upper bounds on the rate of low density parity check (LDPC) codes for which reliable communication is achievable. We first generalize Gallager's bound to a general ...
David Burshtein, Michael Krivelevich, Simon Litsyn...
TIT
2010
88views Education» more  TIT 2010»
13 years 4 months ago
Zero-rate feedback can achieve the empirical capacity
The utility of limited feedback for coding over an individual sequence of DMCs is investigated. This study complements recent results showing how limited or noisy feedback can boos...
Krishnan Eswaran, Anand D. Sarwate, Anant Sahai, M...
CCS
2007
ACM
14 years 4 months ago
Robust group key agreement using short broadcasts
A group key agreement protocol (GKA) allows a set of players to establish a shared secret key which can be used to secure a subsequent communication. Several efficient constantrou...
Stanislaw Jarecki, Jihye Kim, Gene Tsudik
SENSYS
2004
ACM
14 years 3 months ago
The dynamic behavior of a data dissemination protocol for network programming at scale
To support network programming, we present Deluge, a reliable data dissemination protocol for propagating large data objects from one or more source nodes to many other nodes over...
Jonathan W. Hui, David E. Culler
ICC
2000
IEEE
376views Communications» more  ICC 2000»
14 years 2 months ago
TCP-Bus: Improving TCP Performance in Wireless Ad-Hoc Networks
Abstract: Reliable data transmission over wireless multi-hop networks, called ad hoc networks, has proven to be non-trivial. TCP (Transmission Control Protocol), a widely used end-...
Dongkyun Kim, Chai-Keong Toh, Yanghee Choi