No label defined (Q4500975)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1498785
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1498785 |
Statements
3 September 2000
0 references
generalized Reed-Muller codes
0 references
minimal span generator matrices
0 references
trellis of a code
0 references
state complexity of a code
0 references
GRM-codes
0 references
0.8706812262535095
0 references
0.8210752010345459
0 references
0.8154069781303406
0 references
Generalized Reed-Muller codes (GRM-codes) and local behavior of their trellises are considered. The state complexity of a code is determined as the state complexity of its minimal trellis. Trellis complexity, as well as state complexity, gives measures of decoding complexity. A minimal span generator matrix for a GRM-code is a generator matrix that gives the minimal trellis. Generic minimal span generator matrices for the family of GRM-codes are presented and studied. For the entire collection see [Zbl 0918.00043].
0 references
