Cart (Loading....) | Create Account
Close category search window
 

ε-Capacity of Binary Symmetric Averaged 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)
Kieffer, J.C. ; Dept. of Electr. & Comput. Eng., Minnesota Univ.

We consider the channel model obtained by averaging binary symmetric channel (BSC) components with respect to a weighting distribution. A nonempty open interval (A, B) is called a capacity gap for this channel model if no channel component has capacity in (A, B) and this property fails for every open interval strictly containing (A, B). For a fixed epsi>0, suppose one wishes to compute the epsi-capacity of the channel, which is the maximum asymptotic rate at which the channel can be encoded via a sequence of channel codes each achieving block error probability lesepsi. In 1963, Parthasarathy provided a formula for epsi-capacity which is valid for all but at most countably many values of epsi. When the formula fails, there exists a unique capacity gap (A, B) such that the epsi-capacity lies in [A, B], but one does not know precisely where. Via a coding theorem and converse, we establish a formula for computing epsi-capacity as a function of the endpoints A, B of the associated capacity gap (A, B); the formula holds whenever the capacity gap is sufficiently narrow in width

Published in:

Information Theory, IEEE Transactions on  (Volume:53 ,  Issue: 1 )

Date of Publication:

Jan. 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.