Some new NP-complete coding problems (Q1280761)
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: Some new NP-complete coding problems |
scientific article; zbMATH DE number 1264528
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some new NP-complete coding problems |
scientific article; zbMATH DE number 1264528 |
Statements
Some new NP-complete coding problems (English)
0 references
13 June 1999
0 references
NP-completeness
0 references
decision problems
0 references
ternary linear codes
0 references
minimum distance decoding
0 references
linear product codes
0 references
