By Topic

A comparison of arbitrary and symmetric channels on the basis of capacity

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
$33 $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)

This paper concerns itseff with certain upper and lower bounds on the capacity of arbitrary discrete, memoryless channels. A given channel is related to an n -ary symmetric channel through a series of operations on the channel matrix, none of which can increase capacity. The bounds are then obtained from the known formula for capacity of a symmetric channel.

Published in:

IEEE Transactions on Information Theory  (Volume:13 ,  Issue: 3 )