On the trellis complexity of block and convolutional codes (Q1389282)
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: On the trellis complexity of block and convolutional codes |
scientific article; zbMATH DE number 1166390
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the trellis complexity of block and convolutional codes |
scientific article; zbMATH DE number 1166390 |
Statements
On the trellis complexity of block and convolutional codes (English)
0 references
16 July 1998
0 references
trellis Viterbi-type decoding algorithms
0 references
block codes
0 references
maximum likelihood decoding
0 references
complexity
0 references
syndrome trellis
0 references
decoding complexity of PUM codes
0 references
upper bound on the minimal trellis complexity
0 references
punctured convolutional codes
0 references
0.8875945210456848
0 references
0.8715888261795044
0 references
0.8554856181144714
0 references
