Berlekamp–Welch algorithm

Known as: Berlekamp-Welch algorithm, Berlakamp - Welch Algorithm, Welch-Berlekamp algorithm 
The Berlekamp–Welch algorithm, also known as the Welch–Berlekamp algorithm, is named for Elwyn R. Berlekamp and Lloyd R. Welch. The algorithm… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
In this paper, the Reed Solomon Code is decoded using the Welch-Berlekamp Algorithm. The RS Decoder is implemented using Hardware… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 5
Is this relevant?
2016
2016
Gabidulin codes are Maximum Rank Distance (MRD) codes. They have been recently generalized to cyclic Galois extension fields. The… (More)
Is this relevant?
2012
2012
Lee codes have been intensively studied for more than 40 years. Interest in these codes has been triggered by the Golomb-Welch… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
Many complex problems like Speech Recognition, Bioinformatics, Climatology, Control and Communication are solved using Hidden… (More)
Is this relevant?
2005
2005
A simple and natural Gao algorithm for decoding algebraic codes is described. Its relation to the Welch-Berlekamp and Euclidean… (More)
Is this relevant?
2002
2002
– The Welch-Berlekamp (WB) key equation arises in the decoding of Reed-Solomon (RS) codes over finite fields where the decoding… (More)
Is this relevant?
2002
2002
Welch–Gong (WG) transformation sequences are binary sequences of period2 1 with two-level autocorrelation. These sequences were… (More)
  • table I
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We prove the long-standing conjecture of Welch stating that for odd = 2 + 1, the power function with = 2 + 3 is maximally… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Let k[D] be the ring of differential operators with coefficients in a differential fieldk. We say that an elementL ofk[D… (More)
Is this relevant?
Highly Cited
1972
Highly Cited
1972
A stochastic model is described for the decoder of an optimal burst-correcting convolutional code. From this model, an upper… (More)
Is this relevant?