Fast remainder decoding for a Reed-Solomon code

Details Fast remainder decoding for a Reed-Solomon code Fast remainder decoding for a Reed-Solomon code

1987-02-10

1989-06-13

Fleming, Michael R.

Excavating

371 39, G06F 1110

Patent

active

048398969

ABSTRACT:
Apparatus and methods are disclosed for providing fast decoding of Reed-Solomon and related codes. Cases of one and two data symbol errors are decoded directly from the remainder using a large pre-computed table without calculating syndromes. Techniques for decoding cases of more than two errors are given where an optimized Chien search is used when more than four errors remain; when four or fewer errors remain, the Chien search is eliminated in favor of locating an error by direct solution of the error locator polynomial. The error locator and syndrome polynomials are adjusted after each error is found, and the error evaluator polynomial need not be computed.

REFERENCES:
patent: 4397022 (1983-08-01), Weng
patent: 4468769 (1984-08-01), Koga
patent: 4509172 (1985-04-01), Chen
patent: 4644543 (1987-02-01), Davis

Affiliated with

Also associated with

Rating

Fast remainder decoding for a Reed-Solomon code does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fast remainder decoding for a Reed-Solomon code, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fast remainder decoding for a Reed-Solomon code will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-1283153