151 search results - page 4 / 31 » Concatenated Polar Codes |
CORR
2008
Springer
14 years 10 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...
APPROX
2007
Springer
15 years 4 months ago
2007
Springer
We give a polynomial time construction of binary codes with the best currently known trade-off between rate and error-correction radius. Specifically, we obtain linear codes ove...
109
click to vote
ETT
2007
14 years 10 months ago
2007
A powerful class of rate-compatible serially concatenated convolutional codes (SCCCs) has been proposed based on minimizing analytical upper bounds on the error probability in the ...
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
VTC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— In this contribution we design the Iteratively Decoded Self-Concatenated Convolutional Codes (SECCC-ID) using Extrinsic Information Transfer (EXIT) charts. Good constit...