New List Decoding Algorithms for Reed–Solomon and BCH Codes

Authors:
Yingquan Wu
Affiliations:
Link_A_Media Devices Corp., Santa Clara, CA
Venue:
IEEE Transactions on Information Theory
Year:
2008

Citing 0
Cited 5

Efficient interpolation in the Guruswami-Sudan algorithm

IEEE Transactions on Information Theory
A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes

Information Processing Letters
Syndrome decoding of Reed-Solomon codes beyond half the minimum distance based on shift-register synthesis

IEEE Transactions on Information Theory
List decoding for binary Goppa codes

IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Simplified high-speed high-distance list decoding for alternant codes

PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography

Quantified Score

Hi-index	754.96

Visualization

Abstract

In this paper, we devise a rational curve fitting algorithm and apply it to the list decoding of Reed-Solomon and Bose-Chaudhuri-Hocquenghen (BCH) codes. The resulting list decoding algorithms exhibit the following significant properties.