ScholarLens Back to search
2005•Electronics LettersRequires access

Binary GCD algorithm for computing error locator polynomials in Reed-Solomon decoding

Francisco Argüello

Open publisher page 3 citations

Abstract

The binary GCD algorithm, discovered by Stein, is an alternative to the Euclidean algorithm for computing the greatest common divisor of two integers. In this work, the binary GCD algorithm is applied to Reed-Solomon decoding and a novel iterative algorithm for computing error locator polynomials is proposed. Compared to Euclidean-based algorithms, this algorithm exhibits some speed and area advantages.

About this research paper

What this paper is about

The binary GCD algorithm, discovered by Stein, is an alternative to the Euclidean algorithm for computing the greatest common divisor of two integers. In this work, the binary GCD algorithm is applied to Reed-Solomon decoding and a novel iterative algorithm for computing error locator polynomials is proposed. Compared to Euclidean-based algorithms, this algorithm exhibits some speed and area advantages.

Why it matters

OpenAlex reports 3 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

The binary GCD algorithm, discovered by Stein, is an alternative to the Euclidean algorithm for computing the greatest common divisor of two integers. In this work, the binary GCD algorithm is applied to Reed-Solomon decoding and a novel iterative algorithm for computing error locator polynomials is proposed. Compared to Euclidean-based algorithms, this algorithm exhibits some speed and area advantages.

Key concepts: Euclidean algorithm, Greatest common divisor, Algorithm, Binary number, Decoding methods, Mathematics, Berlekamp–Welch algorithm, Reed–Solomon error correction

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Binary GCD algorithm for computing error locator polynomials in Reed-Solomon decoding — Research Paper | ScholarLens