On computing Verdu's upper bound for a class of maximum-likelihood multiuser detection and sequence detection problems (Q4544752): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Kon Max Wong / rank | |||
| Property / author | |||
| Property / author: Kon Max Wong / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1109/18.959286 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2132750713 / rank | |||
Normal rank | |||
Latest revision as of 19:56, 19 March 2024
scientific article; zbMATH DE number 1776007
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
