# The Welch-Berlekamp Algorithm for Correcting Errors in Data

DevFeed: [The Welch-Berlekamp Algorithm for Correcting Errors in Data](<https://devfeed.tech/articles/the-welch-berlekamp-algorithm-for-correcting-errors-in-data-40387.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2015/09/07/welch-berlekamp/>)

Published: 2015-09-07T11:02:00Z

Content type: tutorial

Language: en

Sources: [Jeremy Kun](<https://devfeed.tech/sources/jeremy-kun.md>)

Topics: [Algorithm](<https://devfeed.tech/topics/algorithm.md>), [Code](<https://devfeed.tech/topics/code.md>), [data](<https://devfeed.tech/topics/data.md>)

Tags: [berlekamp-welsh](<https://devfeed.tech/tags/berlekamp-welsh.md>), [code](<https://devfeed.tech/tags/code.md>), [error-correcting-codes](<https://devfeed.tech/tags/error-correcting-codes.md>), [error-correction](<https://devfeed.tech/tags/error-correction.md>), [finite-fields](<https://devfeed.tech/tags/finite-fields.md>), [graphics](<https://devfeed.tech/tags/graphics.md>), [image-analysis](<https://devfeed.tech/tags/image-analysis.md>), [mathematics](<https://devfeed.tech/tags/mathematics.md>), [polynomial-interpolation](<https://devfeed.tech/tags/polynomial-interpolation.md>), [polynomials](<https://devfeed.tech/tags/polynomials.md>), [programming](<https://devfeed.tech/tags/programming.md>), [python](<https://devfeed.tech/tags/python.md>), [reed-solomon-codes](<https://devfeed.tech/tags/reed-solomon-codes.md>), [resilience](<https://devfeed.tech/tags/resilience.md>)

## AI overview

This tutorial explains the intuition behind Reed-Solomon error-correcting codes and implements them using polynomial-based encoding. It describes how adding redundant points can provide resilience to corrupted data while limiting the extra information required.

## Source excerpt

In this post we'll implement Reed-Solomon error-correcting codes and use them to play with codes. In our last post we defined Reed-Solomon codes rigorously, but in this post we'll focus on intuition and code. As usual the code and data used in this post is available on this blog's Github page. The main intuition behind Reed-Solomon codes (and basically all the historically major codes) is Error correction is about adding redundancy, and polynomials are a really efficient way to do that.