On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes (Q4034460)
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 optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes |
scientific article; zbMATH DE number 167501
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes |
scientific article; zbMATH DE number 167501 |
Statements
On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes (English)
0 references
16 May 1993
0 references
Reed-Muller code
0 references
optimum bit order
0 references
minimal trellis diagram
0 references
generalized Hamming weight hierarchy
0 references
BCH code
0 references
0.8813250660896301
0 references
0.8732393980026245
0 references
0.8133467435836792
0 references
0.8133467435836792
0 references
0.7937911748886108
0 references
