Asymptotically good codes have infinite trellis complexity (Q4838693)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Asymptotically good codes have infinite trellis complexity |
scientific article; zbMATH DE number 773088
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Asymptotically good codes have infinite trellis complexity |
scientific article; zbMATH DE number 773088 |
Statements
Asymptotically good codes have infinite trellis complexity (English)
0 references
17 December 1995
0 references
trellis complexity
0 references
decoding
0 references
bound
0 references
asymptotically good codes
0 references
0.8533057
0 references
0.8510945
0 references
0.8487467
0 references
0 references
0 references
0.8439328
0 references
0.8409315
0 references
0.83421123
0 references
