Lower bounds on trellis complexity of block codes (Q4880315)
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: Lower bounds on trellis complexity of block codes |
scientific article; zbMATH DE number 884881
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds on trellis complexity of block codes |
scientific article; zbMATH DE number 884881 |
Statements
Lower bounds on trellis complexity of block codes (English)
0 references
2 April 1997
0 references
block codes
0 references
maximum-likelihood decoding
0 references
generalized Hamming weight hierarchy
0 references
dynamics of codes
0 references
lower bound
0 references
state-complexity of linear codes
0 references
nonlinear codes
0 references
trellis complexity
0 references
asymptotic behavior
0 references
0.8838717341423035
0 references
0.8822334408760071
0 references
0.880937933921814
0 references
0.8582374453544617
0 references
