On the complexity of suboptimal decoding for list and decision feedback schemes (Q2489924)
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 5021026
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of suboptimal decoding for list and decision feedback schemes |
scientific article; zbMATH DE number 5021026 |
Statements
On the complexity of suboptimal decoding for list and decision feedback schemes (English)
0 references
28 April 2006
0 references
List decoding
0 references
Decision feedback
0 references
Bounded distance decoding
0 references
Error exponent
0 references
Decoding complexity
0 references
0 references
0.7682605385780334
0 references
0.7550554275512695
0 references
0.7539591193199158
0 references
