NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
A burst-correcting algorithm for Reed Solomon codesThe Bose, Chaudhuri, and Hocquenghem (BCH) codes form a large class of powerful error-correcting cyclic codes. Among the non-binary BCH codes, the most important subclass is the Reed Solomon (RS) codes. Reed Solomon codes have the ability to correct random and burst errors. It is well known that an (n,k) RS code can correct up to (n-k)/2 random errors. When burst errors are involved, the error correcting ability of the RS code can be increased beyond (n-k)/2. It has previously been show that RS codes can reliably correct burst errors of length greater than (n-k)/2. In this paper, a new decoding algorithm is given which can also correct a burst error of length greater than (n-k)/2.
Document ID
19940004370
Acquisition Source
Legacy CDMS
Document Type
Conference Paper
Authors
Chen, J.
(Idaho Univ. Moscow, ID, United States)
Owsley, P.
(Advanced Hardware Architectures Moscow, ID., United States)
Date Acquired
August 16, 2013
Publication Date
November 6, 1990
Publication Information
Publication: The 2nd 1990 NASA SERC Symposium on VLSI Design
Subject Category
Computer Programming And Software
Accession Number
94N71125
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.

Available Downloads

There are no available downloads for this record.
No Preview Available