By Topic

Lower bounds in the capacity of permutation 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

2 Author(s)

In this paper, permutation channels, which include the rank channels and doubly uniform channels, are defined. A lower bound on the capacities of these channels is obtained with help of nonparametric signal-detection theory. This bound reduces to the actual capacity for memoryless doubly uniform channels by properly selecting the associated nonparametric detectors, The lower bounds on the capacities of the rank channels are expressed in terms of Kendalrs rank correlation coefficient. When the signal power is low, the comparison between a rank channel and a memoryless binary symmetric channel is expressed in terms of the Pitman-Noether asymptotic relative efficiency.

Published in:

Information Theory, IEEE Transactions on  (Volume:17 ,  Issue: 2 )