You are not currently logged in.
Access JSTOR through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Channel Entropy and Primitive Approximation
David L. Neuhoff and Paul C. Shields
The Annals of Probability
Vol. 10, No. 1 (Feb., 1982), pp. 188-198
Published by: Institute of Mathematical Statistics
Stable URL: http://www.jstor.org/stable/2243780
Page Count: 11
You can always find the topics here!Topics: Entropy, Channel noise, Alphabets, Approximation, Integers, Simulations, Block codes, Isomorphism
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
For stationary channels, channel entropy is defined as the supremum of the conditional output entropy over all stationary input sources. If the channel is d̄-continuous and conditionally almost block independent, channel entropy gives an upper bound to the output rate of the channel. Furthermore, the channel can be approximated arbitrarily well in the d̄-metric by any primitive channel whose noise source entropy exceeds channel entropy and cannot be so approximated if the noise source entropy is less than channel entropy.
The Annals of Probability © 1982 Institute of Mathematical Statistics