By Topic

On the error probability for a class of binary recursive feedback strategies

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)

The error probability for a class of binary recursive feedback strategies is evaluated. An exact analysis is given for both a nonsequential and a sequential decision strategy. We obtain the interesting result that even for the nonsequential receiver the error probability vanishes exponentially fast at channel capacity. A similar result had been previously obtained by Horstein for the sequential receiver, but was believed to be a consequence of the sequential nature of his decision strategy. For rates below capacity our feedback strategies have two error exponents, i.e., a lower error exponent E^- (R) and an upper error exponent E^+ (R) . The lower error exponent E^- (R) exhibits an anomalous behavior in that E^- (R) increases monotonically from E^- (0) = 0 to E^- (C) = E(C) as the rate R increases from 0 to capacity.

Published in:

Information Theory, IEEE Transactions on  (Volume:19 ,  Issue: 4 )