Burst-error-correcting algorithm for Reed-Solomon codes and its performance over a bursty channel

Liuguo Yin, Jianhua Lu, K. B. Letaief, Youshou Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Various communication and storage systems are likely corrupted by bursts of noise. These bursts may be long in duration, resulting in a significant degradation for the system performance. Reed-Solomon (RS) codes are proven to be very effective in correcting burst errors. According to the Singleton bound, the maximum length of burst errors that can be corrected by an (n, k) RS code is (n-k)/2 symbols. However, it turns out that, if correlation between erroneous symbols within bursts is considered and well used, the variables for burst locations will be decreased and, accordingly, decoding capability may be enhanced with increased length of correctable bursts. As such, we propose a new burst-error-correcting algorithm. It is shown that, for (n, k) RS codes, this algorithm can correct continuous burst errors with length that approaches to n-k symbols with fairly low miscorrection probability, achieving a good performance over long-burst channels.

Original languageEnglish
Title of host publication2002 International Conference on Communications, Circuits and Systems and West Sino Exposition, ICCCAS 2002 - Proceedings
EditorsLemin Li
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages77-81
Number of pages5
ISBN (Electronic)0780375475, 9780780375475
DOIs
Publication statusPublished - 1 Jan 2002
Event1st International Conference on Communications, Circuits and Systems, ICCCAS 2002 - Chengdu, China
Duration: 29 Jun 20021 Jul 2002

Publication series

Name2002 International Conference on Communications, Circuits and Systems and West Sino Exposition, ICCCAS 2002 - Proceedings

Other

Other1st International Conference on Communications, Circuits and Systems, ICCCAS 2002
CountryChina
CityChengdu
Period29/6/021/7/02

    Fingerprint

Keywords

  • Reed-Solomon code
  • burst errors
  • burst-error-correcting capability
  • decoding algorithms

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Networks and Communications
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Yin, L., Lu, J., Letaief, K. B., & Wu, Y. (2002). Burst-error-correcting algorithm for Reed-Solomon codes and its performance over a bursty channel. In L. Li (Ed.), 2002 International Conference on Communications, Circuits and Systems and West Sino Exposition, ICCCAS 2002 - Proceedings (pp. 77-81). [1180576] (2002 International Conference on Communications, Circuits and Systems and West Sino Exposition, ICCCAS 2002 - Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCCAS.2002.1180576