64 search results - page 2 / 13 » Distance distribution of binary codes and the error probabil... |
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion...
TIT
2008
13 years 4 months ago
2008
In this correspondence, the stopping set of turbo codes with iterative decoding in the binary erasure channel is defined. Block and bit erasure probabilities of turbo codes are stu...
ICCCN
2007
IEEE
13 years 11 months ago
2007
IEEE
—For real-time wireless communications, short forward error-correcting (FEC) codes are indispensable due to the strict delay requirement. In this paper we study the performance o...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
The asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input outp...
ICIP
2007
IEEE
14 years 6 months ago
2007
IEEE
This paper describes Slepian-Wolf codes based on overlapped quasi-arithmetic codes, where overlapping allows lossy compression of the source below its entropy. In the context of s...