On computing Verdu's upper bound for a class of maximum-likelihood multiuser detection and sequence detection problems (Q4544752)
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: On computing Verdu's upper bound for a class of maximum-likelihood multiuser detection and sequence detection problems |
scientific article; zbMATH DE number 1776007
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On computing Verdu's upper bound for a class of maximum-likelihood multiuser detection and sequence detection problems |
scientific article; zbMATH DE number 1776007 |
Statements
On computing Verdu's upper bound for a class of maximum-likelihood multiuser detection and sequence detection problems (English)
0 references
4 August 2002
0 references
maximum-likelihood detection
0 references
indecomposable error vectors
0 references
bit error performance
0 references
multiuser detector
0 references
0.772156298160553
0 references
0.7702893018722534
0 references
0.7435067296028137
0 references
0.7425238490104675
0 references
