Separation of random number generation and resolvability

Karibik Visweswariah; Sanjeev R. Kulkarni; Sergio Verdu

doi:10.1109/18.868497

Separation of random number generation and resolvability

Karibik Visweswariah, Sanjeev R. Kulkarni, Sergio Verdu

Research output: Contribution to journal › Article › peer-review

11 Scopus citations

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.

Original language	English (US)
Pages (from-to)	2237-2241
Number of pages	5
Journal	IEEE Transactions on Information Theory
Volume	46
Issue number	6
DOIs	https://doi.org/10.1109/18.868497
State	Published - Sep 2000

All Science Journal Classification (ASJC) codes

Information Systems
Computer Science Applications
Library and Information Sciences

Access to Document

10.1109/18.868497

Cite this

@article{ac5f702e002e4e0ab2592833574f5dec,

title = "Separation of random number generation and resolvability",

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.",

author = "Karibik Visweswariah and Kulkarni, {Sanjeev R.} and Sergio Verdu",

year = "2000",

month = sep,

doi = "10.1109/18.868497",

language = "English (US)",

volume = "46",

pages = "2237--2241",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "6",

}

TY - JOUR

T1 - Separation of random number generation and resolvability

AU - Visweswariah, Karibik

AU - Kulkarni, Sanjeev R.

AU - Verdu, Sergio

PY - 2000/9

Y1 - 2000/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0034269268&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034269268&partnerID=8YFLogxK

U2 - 10.1109/18.868497

DO - 10.1109/18.868497

M3 - Article

AN - SCOPUS:0034269268

SN - 0018-9448

VL - 46

SP - 2237

EP - 2241

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 6

ER -

Separation of random number generation and resolvability

Abstract

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this