Please use this identifier to cite or link to this item:
|Title:||Diagonal lattice space-time codes from number fields and asymptotic bounds|
|Citation:||Xing, C. (2007-11). Diagonal lattice space-time codes from number fields and asymptotic bounds. IEEE Transactions on Information Theory 53 (11) : 3921-3926. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2007.907473|
|Abstract:||In this paper, we reformulate some constructions of real and complex diagonal lattice space-time codes from number fields which have been given explicitly or implicitly by other researchers. These constructions establish a connection between good diagonal lattice space-time codes and number fields with small absolute values of discriminants. We present two tables for diversity products of some lattice space-time codes from these constructions. The maximal rank of diagonal lattice space-time codes with positive diversity product is determined. We also discuss the asymptotic problem of lattice space-time codes. By using an infinite tower of Hilbert class field and a tamely ramified class field tower, we obtain asymptotically good sequences of lattice space-time codes. Some asymptotic upper bounds are given in the paper as well. © 2007 IEEE.|
|Source Title:||IEEE Transactions on Information Theory|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 21, 2018
WEB OF SCIENCETM
checked on May 1, 2018
checked on Apr 20, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.