DocumentCode
934243
Title
Characterizations of 
-total boundedness for classes of B sources
Author
Kieffer, John C.
Volume
28
Issue
1
fYear
1982
fDate
1/1/1982 12:00:00 AM
Firstpage
26
Lastpage
35
Abstract
Strong universal coding is possible for any dass of ergodic sources on a finite alphabet which is totally bounded in the 
distance. In order to implement this theorem, several necessary and sufficient conditions are given in order for a class of 
sources to be -totally bounded. The conditions are applied to several examples. Of independent interest is a result which allows one to model a -totally bounded class of sources as an encoding of the dass of memoryless sources, where the encoder satisfies a certain continuity property.
distance. In order to implement this theorem, several necessary and sufficient conditions are given in order for a class of sources to be -totally bounded. The conditions are applied to several examples. Of independent interest is a result which allows one to model a -totally bounded class of sources as an encoding of the dass of memoryless sources, where the encoder satisfies a certain continuity property.Keywords
Source coding; Distortion measurement; Encoding; Helium; Information theory; Mathematics; Random variables; Source coding; Sufficient conditions;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1982.1056451
Filename
1056451
Link To Document