By Topic

A partial ordering for binary channels

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)

The properties of iterated binary channels are investigated. An ordering (defined by the symbolsupset) of communication channels with two possible inputs and any number of possible outputs is defined. For any two such channelsC_1andC_2, this ordering has the property that ifC_1 supset C_2, the minimum average loss when usingC_1will be less than the minimum average loss usingC_2, independent of the losses assigned to the various errors, and independent of the statistics of the source. This ordering is applied to 1) the general binary channel, 2) the iterated binary symmetric channel, and 3) the unreliable binary symmetric channel when used with many iterations. Curves allowing one to use the ordering are given, and an example using these curves is worked out.

Published in:

Information Theory, IRE Transactions on  (Volume:6 ,  Issue: 5 )