A fast decoding algorithm for Reed-Solomon codes with enhanced burst correcting capability

L. Yin, J. Lu, K. B. Letaief, Y. Wu

Research output: Contribution to journalConference article

2 Citations (Scopus)


Based on the properties of cyclic codes, a new decoding algorithm for burst-error-correction is proposed in this paper. This algorithm can effectively correct burst errors with length that approaches to n-k for (n, k) Reed-Solomon (RS) codes. Moreover, due to the use of error locations correlation within a burst, divisions are exempted from the decoding process, achieving a fast decoding algorithm with much less computational complexity compared with existing algorithms. It is shown that the proposed algorithm can be widely used in wireless communications, wireless digital broadcast systems, and so on.

Original languageEnglish
Pages (from-to)1477-1481
Number of pages5
JournalIEEE Vehicular Technology Conference
Issue number54ND
Publication statusPublished - 1 Jan 2001
EventIEEE 54th Vehicular Technology Conference (VTC FALL 2001) - Atlantic City, NJ, United States
Duration: 7 Oct 200111 Oct 2001


ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this