Abstract
The class of discrete stationary channels with memory that can be arbitrarily well approximated by indecomposable finite state channels is investigated. The <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">\bar{d}</tex> 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 nonanticipating <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">\bar{d}</tex> -continuous, conditional almost block independent (CABI) channels. In addition, it is shown that for a large class of finite state channels, <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">\bar{d}</tex> continuity and CABI imply indecomposability.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
