Upper bound on the capacity of a random multiple-access system (Q1098818)
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: Upper bound on the capacity of a random multiple-access system |
scientific article; zbMATH DE number 4037752
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bound on the capacity of a random multiple-access system |
scientific article; zbMATH DE number 4037752 |
Statements
Upper bound on the capacity of a random multiple-access system (English)
0 references
1988
0 references
Transmission with blocks of constant length and Poisson probability is considered. For a random multiple-access broadcast channel an upper bound for the channel capacity \(C\leq 0.568\) is obtained which is better than the bound 0.578 derived by Tzan and Berger.
0 references
multiple-access protocols
0 references
blocks of constant length
0 references
Poisson probability
0 references
random multiple-access broadcast channel
0 references
channel capacity
0 references
