By Topic

Indecomposable finite state channels and primative approximation

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

2 Author(s)

The class of discrete stationary channels with memory that can be arbitrarily well approximated by indecomposable finite state channels is investigated. Thebar{d}concept of channel distance is used to quantify the notion of one channel approximating another, and it is shown that the class of interest equals the class of channels approximable by nonanticipating primitive channels. The latter class includes all nonanticipating finite memory channels and all nonanticipatingbar{d}-continuous, conditional almost block independent (CABI) channels. In addition, it is shown that for a large class of finite state channels,bar{d}continuity and CABI imply indecomposability.

Published in:

Information Theory, IEEE Transactions on  (Volume:28 ,  Issue: 1 )