DocumentCode
921877
Title
A lower bound on the probability of decoding error for the finite-state channel (Corresp.)
Author
Kieffer, John C.
Volume
20
Issue
4
fYear
1974
fDate
7/1/1974 12:00:00 AM
Firstpage
549
Lastpage
551
Abstract
A new lower bound on the probability of decoding error for transmission at high rates over a finite-state channel is obtained. It is a dual to the random coding bound of Yudkin and is a generalization of the Arimoto converse to the coding theorem for discrete memoryless channels. It also implies the strong converse to the coding theorem for indecomposable channels.
Keywords
Decoding; Amplitude modulation; Channel capacity; Codes; Data communication; Decoding; Equations; Filters; Interference; Memoryless systems; Pulse modulation;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1974.1055241
Filename
1055241
Link To Document