Two new decoding algorithms for Reed-Solomon codes
type: Item
instance of: scholarly article
title: Two new decoding algorithms for Reed-Solomon codes
zbMATH Open document ID: 0795.94016
DOI: 10.1007/BF01196623
author: Tomik Yaghoobian
author: Ian Blake
published in: Applicable Algebra in Engineering, Communication and Computing
publication date: 1994-09-25T00:00:00Z
review text: Two new decoding algorithms for Reed-Solomon codes are presented, based on the Berlekamp-Welch algorithm. The first one uses the extended Euclidean algorithm and is very efficient for VLSI implementation. The second one is similar to the classical Peterson algorithm but works with remainders rather than with syndromes. The complexity of the algorithms are comparable to the classical ones and as such they may be a viable alternative for decoding Reed-Solomon codes. Pascal-like descriptions are given, and comparisons with different methods are made. Error-and-erasure decoding is not included.
Mathematics Subject Classification ID: 94B35
zbMATH DE Number: 486904
zbMATH Keywords: error correcting codes
zbMATH Keywords: decoding algorithms
zbMATH Keywords: Reed-Solomon codes
zbMATH Keywords: Berlekamp-Welch algorithm
zbMATH Keywords: extended Euclidean algorithm
zbMATH Keywords: VLSI implementation
zbMATH Keywords: Peterson algorithm
reviewed by: L. M. G. M. Tolhuizen
MaRDI profile type: Publication
cites work: Algebraic coding theory
cites work: Bit-serial Reed - Solomon encoders
cites work: Q3688305
cites work: Systolic VLSI Arrays for Polynomial GCD Computation
cites work: Q4146667
cites work: Q4156696
cites work: Generalized key-equation of remainder decoding algorithm for Reed-Solomon codes
cites work: A systolic Reed-Solomon encoder
cites work: A VLSI Design of a Pipeline Reed-Solomon Decoder
cites work: A method for solving key equation for decoding goppa codes
full work available at URL: https://doi.org/10.1007/bf01196623
OpenAlex ID: W2050784748
description: scientific article; zbMATH DE number 486904