DocumentCode
1381698
Title
Separation of random number generation and resolvability
Author
Visweswariah, Karthik ; Kulkarni, Sanjeev R. ; Verdú, Sergio
Author_Institution
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Volume
46
Issue
6
fYear
2000
fDate
9/1/2000 12:00:00 AM
Firstpage
2237
Lastpage
2241
Abstract
We consider the problem of determining when a given source can be used to approximate the output due to any input to a given channel. We provide achievability and converse results for a general source and channel. For the special case of a full-rank discrete memoryless channel we give a stronger converse result than we can give for a general channel
Keywords
channel coding; information theory; memoryless systems; random number generation; source coding; converse results; full-rank discrete memoryless channel; general channel; general source; random number generation; resolvability; source-channel separation; Channel coding; Error correction codes; Memoryless systems; Notice of Violation; Random number generation; Statistics; Welding;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.868497
Filename
868497
Link To Document