On the Optimality of Lattice Coding and Decoding in Multiple Access Channels

Abstract

In this paper, we consider a class of multiple access lattice space-time coding and decoding schemes. We prove an extended version of the Minkowski-Hlawka theorem, utilizing independent Loeliger ensembles. Applying this extension, we prove that lattice coding and decoding achieves the optimal diversity-multiplexing tradeoff of multiple access channels.