格型空时码的MAC-DMT的代数分析
An algebraic look into MAC-DMT of lattice space-time codes
摘要：
在本文中，我们集中在分集复用增益权衡（DMT）的一些空时格码。首先，我们给出了有限维格码的DMT界。然后，我们恢复了众所周知的结果DMT的代数数域码和Alamandi码通过使用的联合界，看到这些代码确实实现了前面提到的界。在我们的分析有趣的连接到戴德金的zeta函数和单位群的代数数域被发现。最后证明了数域码和Alamanti码在一定意义上都是多址信道（MAC）中的最优码。
英文摘要：
In this paper we are concentrating on the diversity-multiplexing gain trade-off (DMT) of some space-time lattice codes. First we give a DMT bound for lattice codes having restricted dimension. We then recover the well known results of the DMT of algebraic number field codes and the Alamouti code by using the union bound and see that these codes do achieve the previously mentioned bound. During our analysis interesting connections to the Dedekind's zeta-function and to the unit group of algebraic number fields are revealed. Finally we prove that both the number field codes and Alamouti code are in some sense optimal codes in the multiple access channel (MAC).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
