A universal Reed-Solomon decoder

Authors:
Richard E. Blahut
Affiliations:
IBM Federal Systems Division, Owego, New York
Venue:
IBM Journal of Research and Development
Year:
1984

Citing 0
Cited 3

Key Management Schemes for Peer-to-Peer Multimedia Streaming Overlay Networks

WISTP '09 Proceedings of the 3rd IFIP WG 11.2 International Workshop on Information Security Theory and Practice. Smart Devices, Pervasive Systems, and Ubiquitous Networks
A novel design of reconfigurable Fourier transform operator over (C) and GF (Ft) for future multi-standards SDR equipments

International Journal of Communication Networks and Distributed Systems
Sparse multivariate function recovery from values with noise and outlier errors

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

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.