Abstract
Some topologies are defined on the set S of all discrete stationary channels with given finite input and output alphabets, which are weaker than the topology of Neuhoff and Shields arising from the d concept of channel distance. The closure of various subsets of § with respect to certain of these topologies on S are determined. For example, a topology on S is introduced with respect to which the set of weakly continuous channels (the most general class of channels for which coding theorems of information theory have been obtained) is the closure in § of the set of channels with input finite memory and anticipation. As a by-product, results are obtained on simulating channels by block codes and on constructing sliding-block codes from block codes using sets called coding sets.
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.
