Sciweavers

1184 search results - page 43 / 237
» Algorithmic Results in List Decoding
Sort
View
CORR
2008
Springer
117views Education» more  CORR 2008»
14 years 10 months ago
Complexity of Decoding Positive-Rate Reed-Solomon Codes
Abstract. The complexity of maximum likelihood decoding of the ReedSolomon codes [q -1, k]q is a well known open problem. The only known result [4] in this direction states that it...
Qi Cheng, Daqing Wan
DATE
1997
IEEE
89views Hardware» more  DATE 1997»
15 years 4 months ago
Cone-based clustering heuristic for list-scheduling algorithms
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...
Sriram Govindarajan, Ranga Vemuri
ICASSP
2011
IEEE
14 years 3 months ago
Optimal and low-complexity iterative joint network/channel decoding for the multiple-access relay channel
In this paper, we investigate joint network and channel decoding algorithms for the multiple-access relay channel. We consider a realistic reference scenario with Rayleigh fading ...
Xuan-Thang Vu, Marco Di Renzo, Pierre Duhamel
GLOBECOM
2007
IEEE
15 years 6 months ago
Iterative Decoding of Concatenated Channel Coding and Trellis Shaping Based on Markov Model
—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...
Makoto Tanahashi, Hideki Ochiai
ICASSP
2011
IEEE
14 years 3 months ago
Linear time decoding of real-field codes over high error rate channels
This paper proposes a novel algorithm for decoding real-field codes over erroneous channels, where the encoded message is corrupted by sparse errors, i.e., impulsive noise. The m...
Zaixing He, Takahiro Ogawa, Miki Haseyama