DocumentCode
919464
Title
On the converse to the coding theorem for discrete memoryless channels (Corresp.)
Author
Arimoto, S.
Volume
19
Issue
3
fYear
1973
fDate
5/1/1973 12:00:00 AM
Firstpage
357
Lastpage
359
Abstract
A new lower bound on the probability of decoding error for the case of rates above capacity is presented. It forms a natural companion to Gallager´s random coding bound for rates below capacity. The strong converse to the coding theorem follows immediately from the proposed lower bound.
Keywords
Decoding; Memoryless channels; Capacity planning; Codes; Convergence; H infinity control; Information theory; Maximum likelihood decoding; Memoryless systems; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1973.1055007
Filename
1055007
Link To Document