On identification capacity of infinite alphabets or continuous-time channels (Q2705974)
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 1578571
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On identification capacity of infinite alphabets or continuous-time channels |
scientific article; zbMATH DE number 1578571 |
Statements
On identification capacity of infinite alphabets or continuous-time channels (English)
0 references
19 March 2001
0 references
identification capacity
0 references
coding theorem
0 references
Poisson channels
0 references
discrete-time channel
0 references
Gaussian channels
0 references
bandwidth
0 references
Shannon capacity
0 references
0.7963531613349915
0 references
0.7912499308586121
0 references
0.7864252924919128
0 references
0.7864252924919128
0 references
0.786078929901123
0 references
