Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
