Decoding complexity bound for linear block codes (Q911553)
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: Decoding complexity bound for linear block codes |
scientific article; zbMATH DE number 4141955
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Decoding complexity bound for linear block codes |
scientific article; zbMATH DE number 4141955 |
Statements
Decoding complexity bound for linear block codes (English)
0 references
1989
0 references
See the review in Zbl 0685.94007.
0 references
decoding complexity of q-ary block-linear codes
0 references
maximum-likelihood decoding algorithm
0 references
L-decoding algorithm
0 references
q-ary symmetric memoryles channel
0 references
