|
Problemy Peredachi Informatsii, 1995, Volume 31, Issue 3, Pages 24–34
(Mi ppi281)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Information Theory
The Law of Large Numbers for Capacity of Memoryless Channels with a Random Matrix of Transition Probabilities
A. S. Ambrosimov, A. N. Timashev
Abstract:
We prove that the capacity of a discrete memoryless channel with a random $n\times n$ matrix of transition probabilities tends almost surely to $1-\gamma$ as $n\to\infty$, where $\gamma=0,5772\dots$ is the Euler constant.
Received: 05.07.1994
Citation:
A. S. Ambrosimov, A. N. Timashev, “The Law of Large Numbers for Capacity of Memoryless Channels with a Random Matrix of Transition Probabilities”, Probl. Peredachi Inf., 31:3 (1995), 24–34; Problems Inform. Transmission, 31:3 (1995), 216–224
Linking options:
https://www.mathnet.ru/eng/ppi281 https://www.mathnet.ru/eng/ppi/v31/i3/p24
|
Statistics & downloads: |
Abstract page: | 248 | Full-text PDF : | 93 |
|