DocumentCode
915094
Title
The complexity of decoders--II: Computational work and decoding time
Author
Savage, John E.
Volume
17
Issue
1
fYear
1971
fDate
1/1/1971 12:00:00 AM
Firstpage
77
Lastpage
85
Abstract
The computational work and the time required to decode with reliability
at code rate
on noisy channels are defined, and bounds on the size of these measures are developed. A number of ad hoc decoding procedures are ranked on the basis of the computational work they require.
at code rate
on noisy channels are defined, and bounds on the size of these measures are developed. A number of ad hoc decoding procedures are ranked on the basis of the computational work they require.Keywords
Automata; Decoding; Channel capacity; Concatenated codes; Costs; Helium; Information theory; Iterative decoding; Logic; Reliability theory; Size measurement; Time measurement;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1971.1054578
Filename
1054578
Link To Document