93 search results - page 2 / 19 » List decoding algorithms for certain concatenated codes |
STOC
2009
ACM
14 years 5 months ago
2009
ACM
Algebraic codes that achieve list decoding capacity were recently constructed by a careful "folding" of the Reed-Solomon code. The "low-degree" nature of this f...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
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...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
—The trellis shaping (TS) is an effective technique not only for average power reduction of high-order QAM signals, but also for peak power reduction of band-limited single-carri...
JSAC
1998
13 years 4 months ago
1998
—We apply two reduced-computation variants of the BCJR algorithm to the decoding of serial and parallel concatenated convolutional codes. One computes its recursions at only M st...