TY - GEN
T1 - A Wringing-Based Proof of a Second-Order Converse for the Multiple-Access Channel under Maximal Error Probability
AU - Wei, Fei
AU - Kosut, Oliver
N1 - Funding Information:
ACKNOWLEDGMENT This material is based upon work supported by the National Science Foundation under Grant No. CCF-1908725 and Grant No. CCF-1901243.
Publisher Copyright:
© 2021 IEEE.
PY - 2021/7/12
Y1 - 2021/7/12
N2 - The second-order converse bound of multiple access channels is an intriguing problem in information theory. In this work, in the setting of the two-user discrete memoryless multiple access channel (DM-MAC) under the maximal error probability criterion, we investigate the gap between the best achievable rates and the asymptotic capacity region. With 'wringing techniques' and meta-converse arguments, we show that gap at blocklength n is upper bounded by O(1/\sqrt{n}).
AB - The second-order converse bound of multiple access channels is an intriguing problem in information theory. In this work, in the setting of the two-user discrete memoryless multiple access channel (DM-MAC) under the maximal error probability criterion, we investigate the gap between the best achievable rates and the asymptotic capacity region. With 'wringing techniques' and meta-converse arguments, we show that gap at blocklength n is upper bounded by O(1/\sqrt{n}).
UR - http://www.scopus.com/inward/record.url?scp=85115106350&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85115106350&partnerID=8YFLogxK
U2 - 10.1109/ISIT45174.2021.9518136
DO - 10.1109/ISIT45174.2021.9518136
M3 - Conference contribution
AN - SCOPUS:85115106350
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2220
EP - 2225
BT - 2021 IEEE International Symposium on Information Theory, ISIT 2021 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2021 IEEE International Symposium on Information Theory, ISIT 2021
Y2 - 12 July 2021 through 20 July 2021
ER -