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

Tomamichel, M; Tan, VYF

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

Tomamichel, M

Tan, VYF

Permalink

Publication Type:: Journal Article
Citation:: IEEE Transactions on Information Theory, 2013, 59 (11), pp. 7041 - 7051
Issue Date:: 2013-11-04

Open Access

Copyright Clearance Process

Recently Added
In Progress
Open Access

This item is open access.

Adobe PDF

Download Accepted ManuscriptAdobe PDF (261.44 kB)

View on publisher's site

View statistics

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-11-04	en_US
dc.identifier.citation	IEEE Transactions on Information Theory, 2013, 59 (11), pp. 7041 - 7051	en_US
dc.identifier.issn	0018-9448	en_US
dc.identifier.uri	http://hdl.handle.net/10453/117344
dc.description.abstract	This paper shows that the logarithm of the ε-error capacity (average error probability) for n uses of a discrete memoryless channel (DMC) is upper bounded by the normal approximation plus a third-order term that does not exceed 1/2log n +O(1) if the ε-dispersion of the channel is positive. This matches a lower bound by Y. Polyanskiy (2010) for DMCs with positive reverse dispersion. If the ε-dispersion vanishes, the logarithm of the ε-dispersion capacity is upper bounded by n times the capacity plus a constant term except for a small class of DMCs and ε≥1/2. © 1963-2012 IEEE.	en_US
dc.relation.ispartof	IEEE Transactions on Information Theory	en_US
dc.relation.isbasedon	10.1109/TIT.2013.2276077	en_US
dc.subject.classification	Networking & Telecommunications	en_US
dc.title	A tight upper bound for the third-order asymptotics for most discrete memoryless channels	en_US
dc.type	Journal Article
utslib.citation.volume	11	en_US
utslib.citation.volume	59	en_US
utslib.for	0801 Artificial Intelligence and Image Processing	en_US
utslib.for	0906 Electrical and Electronic Engineering	en_US
utslib.for	1005 Communications Technologies	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	open_access
pubs.issue	11	en_US
pubs.publication-status	Published	en_US
pubs.volume	59	en_US

Abstract:

This paper shows that the logarithm of the ε-error capacity (average error probability) for n uses of a discrete memoryless channel (DMC) is upper bounded by the normal approximation plus a third-order term that does not exceed 1/2log n +O(1) if the ε-dispersion of the channel is positive. This matches a lower bound by Y. Polyanskiy (2010) for DMCs with positive reverse dispersion. If the ε-dispersion vanishes, the logarithm of the ε-dispersion capacity is upper bounded by n times the capacity plus a constant term except for a small class of DMCs and ε≥1/2. © 1963-2012 IEEE.

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

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