On the complexity of minimum distance decoding of long linear codes (Q4701401): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:59, 7 February 2024
scientific article; zbMATH DE number 1365309
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
