Sciweavers

76 search results - page 9 / 16
» Random codes: Minimum distances and error exponents
Sort
View
ICC
2007
IEEE
15 years 4 months ago
Noncoherent Block-Coded QAM
— 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...
Ruey-Yi Wei, Tzu-Ching Sue, Hsi-Hua Wang, Chin-Sun...
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
15 years 10 months ago
Better extractors for better codes?
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...
Venkatesan Guruswami
CORR
2008
Springer
98views Education» more  CORR 2008»
14 years 9 months ago
High-SNR Analysis of Outage-Limited Communications with Bursty and Delay-Limited Information
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...
Somsak Kittipiyakul, Petros Elia, Tara Javidi
TSP
2008
101views more  TSP 2008»
14 years 9 months ago
Optimal Node Density for Detection in Energy-Constrained Random Networks
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...
Animashree Anandkumar, Lang Tong, Ananthram Swami
ADHOCNOW
2005
Springer
15 years 3 months ago
Reed-Solomon and Hermitian Code-Based Scheduling Protocols for Wireless Ad Hoc Networks
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...
Carlos H. Rentel, Thomas Kunz