Bounds on the trellis size of linear block codes (Q4034451)
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: Bounds on the trellis size of linear block codes |
scientific article; zbMATH DE number 167494
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounds on the trellis size of linear block codes |
scientific article; zbMATH DE number 167494 |
Statements
Bounds on the trellis size of linear block codes (English)
0 references
16 May 1993
0 references
maximum-likelihood decoding
0 references
soft-decision decoding
0 references
zero-concurring codewords
0 references
contraction index
0 references
minimal trellis representation of linear block codes
0 references
repeated-root cyclic codes
0 references
Reed-Muller codes
0 references
0.9612055
0 references
0.94628286
0 references
0.9424141
0 references
0.9408642
0 references
0.9338525
0 references
0.92660916
0 references
0.91478646
0 references
