By Topic

Coding theorem and its converse for continuous incrementally stationary channels with finite incremental memory (Corresp.)

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)

We define continuous incrementally stationary channels with finite incremental input- and output-memories and prove the coding theorem and its converse for such channels. These channels include, as special cases, stationary channels with finite input- and output-memories and incrementally stationary and memoryless channels. The former is defined here and the latter has been defined previously. It is emphasized that, with an elementary measure-theoretic formulation, the standard method of proving the coding theorem for discrete channels becomes directly applicable for continuous channels. Consequently, the tedious step of representing a continuous channel by an infinite series of discrete channels can be avoided entirely.

Published in:

Information Theory, IEEE Transactions on  (Volume:18 ,  Issue: 4 )