On Reed-Solomon codes (Q2430341): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11401-010-0622-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2053340927 / rank | |||
Normal rank | |||
Revision as of 00:51, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Reed-Solomon codes |
scientific article |
Statements
On Reed-Solomon codes (English)
0 references
6 April 2011
0 references
The complexity of decoding the standard Reed-Solomon code is a well-known open problem in coding theory. This two-part paper addresses this problem. In the first part, the author improves known upper bounds for the error distance of a received word to a Reed-Solomon code over \(\text{GF}(q)\). These are useful in determining if efficient list-decoding algorithms can be applied. In the second part, the author proves estimates, and even explicit formulas, for the dimension of trace Reed-Solomon codes in some cases.
0 references
error-correcting codes
0 references
list decoding
0 references
Reed-Solomon codes
0 references
