On Reed-Solomon codes (Q2430341)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5875367
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On Reed-Solomon codes |
scientific article; zbMATH DE number 5875367 |
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
0.94908476
0 references
0 references
0 references
0.9170743
0 references
0.9148319
0 references
