The Parametrized Complexity of Some Fundamental Problems in Coding Theory (Q4943754)
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: Publication:4943754 |
scientific article; zbMATH DE number 1416980
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The Parametrized Complexity of Some Fundamental Problems in Coding Theory |
scientific article; zbMATH DE number 1416980 |
Statements
The Parametrized Complexity of Some Fundamental Problems in Coding Theory (English)
0 references
19 March 2000
0 references
parametrized complexity
0 references
linear codes
0 references
decoding
0 references
codes in graphs
0 references
integer lattices
0 references
0.8284121155738831
0 references
0.8089815378189087
0 references
0.8067678213119507
0 references
0.8055998682975769
0 references
