Decoding of certain classes of Reed-Solomon codes (Q3758717)
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 4008276
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Decoding of certain classes of Reed-Solomon codes |
scientific article; zbMATH DE number 4008276 |
Statements
1984
0 references
decoding procedure
0 references
Reed-Solomon codes
0 references
binary images
0 references
permutation decoding
0 references
look-up table
0 references
0.7989527583122253
0 references
0.7941698431968689
0 references
0.7904086709022522
0 references
0.7876439094543457
0 references
0.7796181440353394
0 references
Decoding of certain classes of Reed-Solomon codes (English)
0 references
We present a decoding procedure for certain classes of Reed-Solomon codes over \(\mathrm{GF}(2^m)\) as well as their binary images. The method uses permutation decoding completed in some cases by other techniques for example a short look-up table.
0 references