DocumentCode :
925708
Title :
A simple derivation of the lower bound to 
for discrete memoryless channels (Corresp.)
for discrete memoryless channels (Corresp.)Author :
Dick, R.J.
Volume :
22
Issue :
5
fYear :
1976
fDate :
9/1/1976 12:00:00 AM
Firstpage :
595
Lastpage :
596
Abstract :
The first moment of the decoding effort for stack sequential decoding is overbounded by a relatively simple technique. The resulting lower bound to 
is shown to be equivalent to the best known lower bound.
is shown to be equivalent to the best known lower bound.Keywords :
Memoryless channels; Sequential decoding; Decoding; Filtering; Memoryless systems; Stochastic processes; Upper bound; White noise;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1976.1055609
Filename :
1055609
Link To Document :
