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

preprint2013arXivOpen access

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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.