DocumentCode :
919731
Title :
On the capacity of asymptotically memoryless continuous-time channels (Corresp.)
Author :
Kadota, T.T.
Volume :
19
Issue :
4
fYear :
1973
fDate :
7/1/1973 12:00:00 AM
Firstpage :
556
Lastpage :
557
Abstract :
Previously, a coding theorem and its converse for stationary asymptotically memoryless continuous-time channels were proved, giving the capacity 
with an almost sure constraint on the input cost. For calculation, it is more convenient to find a capacity 
with the constraint on the expected input cost. Obviously, 
, but the coding theorem may not hold for . For a class of input costs typified by the time-average power, we prove the coding theorem for by directly showing 
.
with an almost sure constraint on the input cost. For calculation, it is more convenient to find a capacity with the constraint on the expected input cost. Obviously, , but the coding theorem may not hold for . For a class of input costs typified by the time-average power, we prove the coding theorem for by directly showing .Keywords :
Coding; Memoryless channels; Codes; Constraint theory; Costs; Extraterrestrial measurements; Mutual information; Space stations;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1973.1055033
Filename :
1055033
Link To Document :
