A Simple Technique for the Converse of Finite Blocklength Multiple Access Channels

Abstract

A converse for the Discrete Memoryless Multiple Access Channel is given. The result in [13] is refined, and the third order term is obtained. Moreover, our proof is much simpler than [13]. With little modification, the region can be further improved.

Results are refined

References in corpus (2)

• Information Spectrum Approach to Second-Order Coding Rate in Channel Coding
• Jar Decoding: Non-Asymptotic Converse Coding Theorems, Taylor-Type Expansion, and Optimality