Sciweavers

52 search results - page 3 / 11
» Performance of universal codes over infinite alphabets
Sort
View
ITIIS
2010
138views more  ITIIS 2010»
13 years 3 months ago
Performance Analysis of Large CDMA Random Access Systems with Retransmission Diversity over Fading Channels
The random access systems, with retransmission diversity (RD) employment, over large random spreading code division multiple access (CDMA) channel subject to fading is investigate...
Kai Yu, Yi Sun, Pingzhi Fan, Xianfu Lei, Lei Shu
GLOBECOM
2006
IEEE
13 years 11 months ago
Universal Space-Time Serially Concatenated Trellis Coded Modulations
— In this paper, we propose serially concatenated trellis coded modulations (SCTCMs) that perform consistently close to the available mutual information for the 2-by-2 compound m...
Wen-Yen Weng, Bike Xie, Richard D. Wesel
TIT
2010
103views Education» more  TIT 2010»
12 years 12 months ago
Performance bounds for erasure, list and decision feedback schemes with linear block codes
A message independence property and some new performance upper bounds are derived in this work for erasure, list and decision-feedback schemes with linear block codes transmitted ...
Eran Hof, Igal Sason, Shlomo Shamai
TIT
2010
136views Education» more  TIT 2010»
12 years 12 months ago
The existence of concatenated codes list-decodable up to the hamming bound
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
Venkatesan Guruswami, Atri Rudra
TIT
2008
110views more  TIT 2008»
13 years 5 months ago
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
Venkatesan Guruswami, Atri Rudra