View Item 

Show simple item record

Channel distances and representation
dc.contributor.authorNeuhoff, D. L.en_US
dc.contributor.authorShields, P. C.en_US
dc.date.accessioned2006-04-07T17:47:47Z
dc.date.available2006-04-07T17:47:47Z
dc.date.issued1982en_US
dc.identifier.citationNeuhoff, D.L., Shields, P.C. (1982)."Channel distances and representation." Information and Control 55(1-3): 238-264. <http://hdl.handle.net/2027.42/23849>en_US
dc.identifier.urihttp://www.sciencedirect.com/science/article/B7MFM-4DX44G9-13M/2/6d95cc1f5e8ee0c057fd60a14410efb5en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/23849
dc.description.abstractThe properties of several distance measures for discrete stationary channels with memory are studied. All are based on Ornstein's {if238-1}-random process distance. The strongest of these distances has been employed in a theory concerned with the approximation of {if238-1}-continuous conditionally almost block independent (CABI) channels by primitive and other simple models. Here the approximation with respect to the weaker distances and the equivalence of the weaker distances to the strongest is investigated. In addition, an exact representation of a {if238-3}-continuous CABI channel as an infinite sliding-block coding of the input joined with an I.I.D. noise source is developed.en_US
dc.format.extent1106634 bytes
dc.format.extent3118 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.language.isoen_US
dc.publisherElsevieren_US
dc.titleChannel distances and representationen_US
dc.typeArticleen_US
dc.rights.robotsIndexNoFollowen_US
dc.subject.hlbsecondlevelScience (General)en_US
dc.subject.hlbsecondlevelInformation and Library Scienceen_US
dc.subject.hlbsecondlevelComputer Scienceen_US
dc.subject.hlbtoplevelScienceen_US
dc.subject.hlbtoplevelSocial Sciencesen_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.peerreviewedPeer Revieweden_US
dc.contributor.affiliationumDepartment of Electrical and Computer Engineering, University of Michigan, Ann Arbor, Michigan 48109, USAen_US
dc.contributor.affiliationotherDepartment of Mathematics, Stanford University, Stanford, California 94305, USAen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/23849/1/0000088.pdfen_US
dc.identifier.doihttp://dx.doi.org/10.1016/S0019-9958(82)90610-6en_US
dc.identifier.sourceInformation and Controlen_US
dc.owningcollnameInterdisciplinary and Peer-Reviewed


Files in this item

Name:
0000088.pdf
Size:
1.055MB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.