NP-completeness of the random binary quasi-dyadic coset weight problem and the random binary quasi-dyadic subspace weight problem (Q2965866)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6691895
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | NP-completeness of the random binary quasi-dyadic coset weight problem and the random binary quasi-dyadic subspace weight problem |
scientific article; zbMATH DE number 6691895 |
Statements
3 March 2017
0 references
NP-complete
0 references
quasi-dyadic codes
0 references
syndrome decoding problem
0 references
coset weight problem
0 references
subspace weight problem
0 references
four dimensional matching problem
0 references
0.910009503364563
0 references
0.781254768371582
0 references
0.781254768371582
0 references
0.7804407477378845
0 references
0.763227105140686
0 references
