Solving a class of optimum multiuser detection problems with polynomial complexity (Q4701170)
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: Solving a class of optimum multiuser detection problems with polynomial complexity |
scientific article; zbMATH DE number 1365102
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving a class of optimum multiuser detection problems with polynomial complexity |
scientific article; zbMATH DE number 1365102 |
Statements
Solving a class of optimum multiuser detection problems with polynomial complexity (English)
0 references
21 November 1999
0 references
Gold sequence
0 references
quadratic 0-1 programming
0 references
CDMA
0 references
optimum multiuser detection
0 references
polynomial complexity
0 references
code-division multiple access
0 references
pseudorandom codes
0 references
cross correlation
0 references
0.8461703062057495
0 references
0.8398745656013489
0 references
0.7599208354949951
0 references
0.7575325965881348
0 references
