# reed-solomon code

Published articles for reed-solomon code.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## The Codes of Solomon, Reed, and Muller

DevFeed: [The Codes of Solomon, Reed, and Muller](<https://devfeed.tech/articles/the-codes-of-solomon-reed-and-muller-40380.md>)

Original publisher: [Read original article](<https://www.jeremykun.com/2015/03/23/the-codes-of-solomon-reed-and-muller/>)

Published: 2015-03-23T09:00:00Z

Content type: tutorial

Language: en

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

Topics: [Code](<https://devfeed.tech/topics/code.md>), [Decoding](<https://devfeed.tech/topics/decoding.md>)

Tags: [code](<https://devfeed.tech/tags/code.md>), [coding-theory](<https://devfeed.tech/tags/coding-theory.md>), [decoding](<https://devfeed.tech/tags/decoding.md>), [hamming-code](<https://devfeed.tech/tags/hamming-code.md>), [information-theory](<https://devfeed.tech/tags/information-theory.md>), [linear-codes](<https://devfeed.tech/tags/linear-codes.md>), [projection](<https://devfeed.tech/tags/projection.md>), [reed-muller-code](<https://devfeed.tech/tags/reed-muller-code.md>), [reed-solomon-code](<https://devfeed.tech/tags/reed-solomon-code.md>)

### AI overview

This article introduces Reed-Solomon codes, explains the Singleton bound for codes with parameters (n,k,d)q, proves the bound using a projection map, and relates codes that meet the bound to maximum distance separable codes. It also places Reed-Muller codes in the broader discussion.

### Source excerpt

Last time we defined the Hamming code. We also saw that it meets the Hamming bound, which is a measure of how densely a code can be packed inside an ambient space and still maintain a given distance. This time we'll define the Reed-Solomon code which optimizes a different bound called the Singleton bound, and then generalize them to a larger class of codes called Reed-Muller codes. In future posts we'll consider algorithmic issues behind decoding the codes, for now we just care about their existence and optimality properties.