One-Shot Point-to-Point Channel Simulation

Cao, MX; Ramakrishnan, N; Berta, M; Tomamichel, M

One-Shot Point-to-Point Channel Simulation

Cao, MX Ramakrishnan, N Berta, M Tomamichel, M

Permalink

Publisher:: Institute of Electrical and Electronics Engineers (IEEE)
Publication Type:: Conference Proceeding
Citation:: IEEE International Symposium on Information Theory - Proceedings, 2022, 2022-June, pp. 796-801
Issue Date:: 2022-01-01

Closed Access

	Filename	Description	Size
	One-Shot_Point-to-Point_Channel_Simulation_MARCO_TOMAMICHEL.pdf	Published version	1.02 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Cao, MX
dc.contributor.author	Ramakrishnan, N
dc.contributor.author	Berta, M
dc.contributor.author	Tomamichel, M https://orcid.org/0000-0001-5410-3329
dc.date	2022-06-26
dc.date.accessioned	2023-04-13T01:35:18Z
dc.date.available	2023-04-13T01:35:18Z
dc.date.issued	2022-01-01
dc.identifier.citation	IEEE International Symposium on Information Theory - Proceedings, 2022, 2022-June, pp. 796-801
dc.identifier.isbn	9781665421591
dc.identifier.issn	2157-8095
dc.identifier.uri	http://hdl.handle.net/10453/169717
dc.description.abstract	We study the problem of one-shot channel simulation of DMCs with unlimited shared randomness. For any fixed tolerance measured in total variational distance, we propose an achievability bound and a converse bound on the size of the code to simulate the channel. The achievability bound utilizes the convex split lemma, whereas the converse bound is the result of the relationships between smoothed max-divergences and the max-mutual information. The achievability proof does not rely on a "universal state"(compared with some previous related works), and provides a tighter bound. Using the two bounds, we also provide an alternative proof to the reverse Shannon theorem.
dc.language	en
dc.publisher	Institute of Electrical and Electronics Engineers (IEEE)
dc.relation.ispartof	IEEE International Symposium on Information Theory - Proceedings
dc.relation.ispartof	2022 IEEE International Symposium on Information Theory (ISIT)
dc.relation.isbasedon	10.1109/ISIT50566.2022.9834411
dc.rights	info:eu-repo/semantics/closedAccess
dc.title	One-Shot Point-to-Point Channel Simulation
dc.type	Conference Proceeding
utslib.citation.volume	2022-June
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
utslib.copyright.status	closed_access	*
dc.date.updated	2023-04-13T01:35:16Z
pubs.finish-date	2022-07-01
pubs.publication-status	Published
pubs.start-date	2022-06-26
pubs.volume	2022-June

Abstract:

We study the problem of one-shot channel simulation of DMCs with unlimited shared randomness. For any fixed tolerance measured in total variational distance, we propose an achievability bound and a converse bound on the size of the code to simulate the channel. The achievability bound utilizes the convex split lemma, whereas the converse bound is the result of the relationships between smoothed max-divergences and the max-mutual information. The achievability proof does not rely on a "universal state"(compared with some previous related works), and provides a tighter bound. Using the two bounds, we also provide an alternative proof to the reverse Shannon theorem.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/169717