Te "art of trellis decoding" is computationally hard-for large fields (Q4400342)
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 1182108
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Te "art of trellis decoding" is computationally hard-for large fields |
scientific article; zbMATH DE number 1182108 |
Statements
Te "art of trellis decoding" is computationally hard-for large fields (English)
0 references
2 August 1998
0 references
MDS codes
0 references
NP-hardness
0 references
Vandermonde matrices
0 references
trellis complexity
0 references
0.9466345906257628
0 references
0.8855627179145813
0 references
0.8281675577163696
0 references
