By Topic

A simple derivation of the lower bound to R_{mbox{co\mp}} for discrete memoryless channels (Corresp.)

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 first moment of the decoding effort for stack sequential decoding is overbounded by a relatively simple technique. The resulting lower bound to R_{co\mp} is shown to be equivalent to the best known lower bound.

Published in:

Information Theory, IEEE Transactions on  (Volume:22 ,  Issue: 5 )