On the complexity of minimum distance decoding of long linear codes (Q4701401)
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 complexity of minimum distance decoding of long linear codes |
scientific article; zbMATH DE number 1365309
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of minimum distance decoding of long linear codes |
scientific article; zbMATH DE number 1365309 |
Statements
On the complexity of minimum distance decoding of long linear codes (English)
0 references
21 November 1999
0 references
decoding algorithm
0 references
\(q\)-ary linear codes
0 references
supercode decoding
0 references
error probability
0 references
minimum-distance decoding
0 references
covering-set decoding
0 references
split syndrome decoding
0 references
