| Paper ID | D5-S4-T1.3 |
| Paper Title |
A Wringing-Based Proof of a Second-Order Converse for the Multiple-Access Channel under Maximal Error Probability |
| Authors |
Fei Wei, Oliver Kosut, Arizona State University, United States |
| Session |
D5-S4-T1: Multiple Access Capacity II |
| Chaired Session: |
Friday, 16 July, 23:00 - 23:20 |
| Engagement Session: |
Friday, 16 July, 23:20 - 23:40 |
| Abstract |
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 maximal error probability criterion, we investigate the gap between the best achievable rates and the asymptotic capacity region. With ``wringing techniques'', we show that gap between the largest achievable sum-rate at blocklength $n$ and the sum-capacity is upper bounded by $\mathcal{O}(1/\sqrt{n})$.
|
