DocumentCode
933958
Title
Block coding for weakly continuous channels
Author
Kieffer, John C.
Volume
27
Issue
6
fYear
1981
fDate
11/1/1981 12:00:00 AM
Firstpage
721
Lastpage
727
Abstract
Given a discrete stationary channel
for which the map
carrying each stationary, ergodic input
into the input-output measure
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
-continuous channels. It is shown that every stationary channel
is "almost" weakly continuous in the sense that every input-output measure
for
can be obtained by sending
over an appropriate weakly continuous channel (depending on
). This indicates that weakly continuous channels may be the most general stationary channels for which one would need a coding theorem.
for which the map
carrying each stationary, ergodic input
into the input-output measure
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
-continuous channels. It is shown that every stationary channel
is "almost" weakly continuous in the sense that every input-output measure
for
can be obtained by sending
over an appropriate weakly continuous channel (depending on
). This indicates that weakly continuous channels may be the most general stationary channels for which one would need a coding theorem.Keywords
Block codes; Block codes; Channel capacity; Channel coding; Convergence; Decoding; Entropy; Information rates; Information theory; Mathematics; Memoryless systems;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1981.1056422
Filename
1056422
Link To Document