On the strong converse of the coding theorem for symmetric channels without memory (Q3280460): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| 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.1090/qam/113744 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2565241995 / rank | |||
Normal rank | |||
Latest revision as of 02:09, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the strong converse of the coding theorem for symmetric channels without memory |
scientific article |
Statements
On the strong converse of the coding theorem for symmetric channels without memory (English)
0 references
1960
0 references
probability theory etc.
0 references
