80 search results - page 16 / 16 » Bounds on the decoding complexity of punctured codes on grap... |
TIT
2010
12 years 12 months ago
2010
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...
QSHINE
2005
IEEE
13 years 10 months ago
2005
IEEE
Protocols designed to provide error-free communications over lossy links, at both data link and transport layers, commonly employ the idea of sliding windows, which is based on th...
TIT
2002
13 years 4 months ago
2002
We recently showed that arbitrarily reliable communication is possible within a single coherence interval in Rayleigh flat fading as the symbol-duration of the coherence interval ...
SIGSOFT
2003
ACM
14 years 6 months ago
2003
ACM
Automated finite-state verification techniques have matured considerably in the past several years, but state-space explosion remains an obstacle to their use. Theoretical lower b...
MOBICOM
2003
ACM
13 years 10 months ago
2003
ACM
In this paper, we consider the transport capacity of ad hoc networks with a random flat topology under the present support of an infinite capacity infrastructure network. Such a...