Hybrid list decoding and Kaneko algorithm of Reed-Solomon codes

The authors present a hybrid list decoding and Kaneko algorithm for Reed-Solomon (RS) codes. A new ruling out scheme motivated from Takuya Koumoto´s work for a reduced-complexity list decoding algorithm, which reduces the complexity of the hybrid algorithm, is also proposed. Simulation results show that the performance of the hybrid algorithm for both (15, 7) and (31, 21) RS codes is comparable with the hybrid algorithm which combines the list algorithm and the Chase algorithm. But the complexity of the proposed hybrid algorithm is much less than that of the hybrid algorithm which combines the list algorithm and the Chase algorithm at high signal-to-noise ratios