By Topic

CTH02-2: Cyclic Codes for Correcting Bursts of Errors or Erasures With Iterative Decoding

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Shumei Song ; Dept. of Electr. & Comput. Eng., Univ. of California, Davis, CA ; Shu Lin ; Abdel-Ghaffar, K. ; Zhi Ding
more authors

This paper investigates cyclic codes for correcting bursts of errors from a new point of view. A simple iterative algorithm for correcting bursts of errors is developed. This algorithm is optimal in the sense that it corrects burst of errors of lengths up to the burst-error-correction limit of a cyclic code. Also included in the paper is an iterative process for correcting bursts of erasures.

Published in:

Global Telecommunications Conference, 2006. GLOBECOM '06. IEEE

Date of Conference:

Nov. 27 2006-Dec. 1 2006