76 search results - page 9 / 16 » Random codes: Minimum distances and error exponents |
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper, we investigate block-coded QAM constructed by multilevel coding for the noncoherent generalized likelihood ratio test (GLRT) detector. For the AWGN channel, we d...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
CORR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract-- This work analyzes the high-SNR asymptotic error performance of outage-limited communications with fading, where the number of bits that arrive at the transmitter during...
TSP
2008
13 years 6 months ago
2008
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
ADHOCNOW
2005
Springer
14 years 8 days ago
2005
Springer
Abstract. In this work we investigate bounds on throughput and delay performance of a scheduling protocol that derives its decisions from codes traditionally used to correct or det...