By Topic

Block coding for weakly continuous channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

Given a discrete stationary channel v for which the map \mu \rightarrow \mu v carrying each stationary, ergodic input \mu into the input-output measure \mu v is continuous (with respect to weak convergence) at at least one input, it is shown that every stationary and ergodic source with sufficiently small entropy is block transmissible over the channel. If this weak continuity condition is satisfied at every stationary ergodic input, one obtains the class of weakly continuous channels for which the usual source/channel block coding theorem and converse hold with the usual notion of channel capacity. An example is given to show that the class of weakly continuous channels properly includes the class of \bar{d} -continuous channels. It is shown that every stationary channel v is "almost" weakly continuous in the sense that every input-output measure \mu v for v can be obtained by sending \mu over an appropriate weakly continuous channel (depending on \mu ). This indicates that weakly continuous channels may be the most general stationary channels for which one would need a coding theorem.

Published in:

Information Theory, IEEE Transactions on  (Volume:27 ,  Issue: 6 )