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

TL;DR

This paper presents a simplified and refined converse bound for discrete memoryless multiple access channels, improving upon previous results by including third-order terms and offering a more straightforward proof.

Contribution

It introduces a simpler proof technique for the converse of finite blocklength multiple access channels and refines existing bounds to include third-order terms.

Findings

Refined the converse bound for DMC MACs

Included third-order term in the analysis

Provided a simpler proof method

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.