Sciweavers

76 search results - page 14 / 16
» Random codes: Minimum distances and error exponents
Sort
View
TIT
2010
143views Education» more  TIT 2010»
13 years 1 months ago
Asynchronous CDMA systems with random spreading-part I: fundamental limits
Spectral efficiency for asynchronous code division multiple access (CDMA) with random spreading is calculated in the large system limit. We allow for arbitrary chip waveforms and ...
Laura Cottatellucci, Ralf R. Müller, Mé...
TIT
2002
98views more  TIT 2002»
13 years 6 months ago
DC-free binary convolutional coding
A novel DC-free binary convolutional coding scheme is presented. The proposed scheme achieves the DC-free and error correcting capability simultaneously. The scheme has a simple ca...
Tadashi Wadayama, A. J. Han Vinck
CORR
2010
Springer
105views Education» more  CORR 2010»
13 years 1 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
14 years 1 months ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
ICC
2008
IEEE
125views Communications» more  ICC 2008»
14 years 1 months ago
Asymptotic Performance of DS-CDMA with Linear MMSE Receiver and Limited Feedback
Abstract—Signature quantization for reverse-link Direct Sequence (DS)- Code Division Multiple Access (CDMA) is considered. A receiver assumed to have perfect estimates of channel...
Wiroonsak Santipach