1984•IBM Journal of Research and DevelopmentRequires access

A Universal Reed-Solomon Decoder

Richard E. Blahut

Abstract

Two architectures for universal Reed-Solomon decoders are given. These decoders, called time-domain decoders, work directly on the raw data word as received without the usual syndrome calculation or power-sum-symmetric functions. Up to the limitations of the working registers, the decoders can decode any Reed-Solomon codeword or BCH codeword in the presence of both errors and erasures. Provision is also made for decoding extended codes and shortened codes.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 76 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Code word, BCH code, Reed–Solomon error correction, Decoding methods, Computer science, Soft-decision decoder, Arithmetic, Word (group theory)