A tight upper bound for the third-order asymptotics of discrete memoryless channels

Tomamichel, M; Tan, VYF

A tight upper bound for the third-order asymptotics of discrete memoryless channels

Tomamichel, M

Tan, VYF

Permalink

Publication Type:: Conference Proceeding
Citation:: IEEE International Symposium on Information Theory - Proceedings, 2013, pp. 1536 - 1540
Issue Date:: 2013-12-19

Closed Access

	Filename	Description	Size
	tig.pdf	Published version	155.03 kB	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	Tomamichel, M https://orcid.org/0000-0001-5410-3329	en_US
dc.contributor.author	Tan, VYF	en_US
dc.date.issued	2013-12-19	en_US
dc.identifier.citation	IEEE International Symposium on Information Theory - Proceedings, 2013, pp. 1536 - 1540	en_US
dc.identifier.isbn	9781479904464	en_US
dc.identifier.issn	2157-8095	en_US
dc.identifier.uri	http://hdl.handle.net/10453/119620
dc.description.abstract	This paper shows that the logarithm of the ε-error capacity (average error probability) for n uses of a discrete memoryless channel with positive conditional information variance at every capacity-achieving input distribution is upper bounded by the normal approximation plus a term that does not exceed 1/2 log n + O(1). © 2013 IEEE.	en_US
dc.relation.ispartof	IEEE International Symposium on Information Theory - Proceedings	en_US
dc.relation.isbasedon	10.1109/ISIT.2013.6620484	en_US
dc.title	A tight upper bound for the third-order asymptotics of discrete memoryless channels	en_US
dc.type	Conference Proceeding
utslib.for	020603 Quantum Information, Computation and Communication	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
pubs.organisational-group	/University of Technology Sydney/Strength - QSI - Centre for Quantum Software and Information
utslib.copyright.status	closed_access
pubs.publication-status	Published	en_US

Abstract:

This paper shows that the logarithm of the ε-error capacity (average error probability) for n uses of a discrete memoryless channel with positive conditional information variance at every capacity-achieving input distribution is upper bounded by the normal approximation plus a term that does not exceed 1/2 log n + O(1). © 2013 IEEE.

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

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