The complexity of computing the covering radius of a code (Q3222113)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of computing the covering radius of a code |
scientific article |
Statements
The complexity of computing the covering radius of a code (English)
0 references
1984
0 references
NP-hard
0 references
covering radius
0 references
binary linear code
0 references
polynomial hierarchy
0 references
