Number field lattices achieve Gaussian and Rayleigh channel capacity within a constant gap, 2015 IEEE International Symposium on Information Theory (ISIT), pp.436-440, 2015. ,
DOI : 10.1109/ISIT.2015.7282492
URL : https://hal.archives-ouvertes.fr/hal-01420955
Division algebra codes achieve MIMO block fading channel capacity within a constant gap, 2015 IEEE International Symposium on Information Theory (ISIT), pp.446-450, 2015. ,
DOI : 10.1109/ISIT.2015.7282494
URL : https://hal.archives-ouvertes.fr/hal-01420957
Capacity of Multi-antenna Gaussian Channels, European Transactions on Telecommunications, vol.45, issue.6, pp.585-595, 1999. ,
DOI : 10.1109/18.746779
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.38.6378
Achieving near-capacity on a multiple-antenna channel, IEEE Transactions on Communications, vol.51, issue.3, pp.389-399, 2003. ,
DOI : 10.1109/TCOMM.2003.809789
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.400.8351
LDPC Coded MIMO Multiple Access With Iterative Joint Decoding, IEEE Transactions on Information Theory, vol.51, issue.4, pp.1437-1450, 2005. ,
DOI : 10.1109/TIT.2005.844064
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.591.7777
Sphere Packings, Lattices and Groups, 1988. ,
Full-diversity, high-rate space-time block codes from division algebras, IEEE Transactions on Information Theory, vol.49, issue.10, pp.2596-2616, 2003. ,
DOI : 10.1109/TIT.2003.817831
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.164
Perfect Space-Time Block Codes, IEEE Trans. Inf. Theory, vol.529, 2006. ,
DOI : 10.1109/tit.2006.880010
Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff, IEEE Transactions on Information Theory, vol.52, issue.9, pp.3869-3884, 2006. ,
DOI : 10.1109/TIT.2006.880037
Space-time codes for high data rate wireless communication: performance criterion and code construction, IEEE Transactions on Information Theory, vol.44, issue.2, pp.744-765, 1998. ,
DOI : 10.1109/18.661517
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.4293
On Optimal Multilayer Cyclotomic Space???Time Code Designs, IEEE Transactions on Information Theory, vol.51, issue.3, pp.1102-1135, 2005. ,
DOI : 10.1109/TIT.2004.842630
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.123.3497
On the Densest MIMO Lattices From Cyclic Division Algebras, IEEE Transactions on Information Theory, vol.55, issue.8, pp.3751-3780, 2009. ,
DOI : 10.1109/TIT.2009.2023713
URL : http://arxiv.org/pdf/cs/0703052
Optimal Space–Time Codes for the MIMO Amplify-and-Forward Cooperative Channel, IEEE Transactions on Information Theory, vol.53, issue.2 ,
DOI : 10.1109/TIT.2006.888998
Constructions of multi-block space-time coding schemes that achieve the diversity-multiplexing tradeoff, IEEE Trans. Inf. Theory, vol.54, issue.8, pp.3790-3796, 2008. ,
Approximately-universal space-time codes for the parallel, multi-block and cooperative dynamic-decode-and-forward channels ,
DOI : 10.1109/isit.2009.5205775
Construction Methods for Asymmetric and Multiblock Space???Time Codes, IEEE Transactions on Information Theory, vol.55, issue.3, pp.1086-1103, 2009. ,
DOI : 10.1109/TIT.2008.2011449
URL : https://ir.nctu.edu.tw:443/bitstream/11536/12634/1/000263928600015.pdf
Fast-Decodable Asymmetric Space-Time Codes From Division Algebras, IEEE Transactions on Information Theory, vol.58, issue.4, pp.2362-2384, 2012. ,
DOI : 10.1109/TIT.2011.2176310
URL : http://arxiv.org/abs/1010.5644
A Noncommutative Analogue of the Odlyzko Bounds and Bounds on Performance for Space-Time Lattice Codes, IEEE Transactions on Information Theory, vol.61, issue.4, pp.1971-1984, 2015. ,
DOI : 10.1109/TIT.2015.2406698
Tours de corps de classes et estimations de discriminants, Inventiones Mathematicae, vol.171, issue.25, pp.65-73, 1978. ,
DOI : 10.1007/BF01389902
Computing ray class groups, conductors and discriminants, Mathematics of Computation, vol.67, issue.222, pp.773-795, 1998. ,
DOI : 10.1090/S0025-5718-98-00912-0
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.192.222
Computing class fields via the Artin map, Mathematics of Computation, vol.70, issue.235, pp.1293-1303, 2001. ,
DOI : 10.1090/S0025-5718-00-01255-2
Algebraic Number Theory and Code Design for Rayleigh Fading Channels, Foundations and Trends in Communications and Information Theory, pp.333-415, 2004. ,
DOI : 10.1561/0100000003
URL : http://authors.library.caltech.edu/9467/1/0100000003.pdf
Cyclic Division Algebras: A Tool for Space-Time Coding, Foundations and Trends in Communications and Information Theory, pp.1-95, 2007. ,
DOI : 10.1561/0100000016
Approximately universal codes over slow-fading channels, IEEE Transactions on Information Theory, vol.52, issue.7, pp.3233-3258, 2006. ,
DOI : 10.1109/TIT.2006.876226
URL : http://arxiv.org/pdf/cs/0512017
Some optimal codes have structure, IEEE Journal on Selected Areas in Communications, vol.7, issue.6, pp.893-899, 1989. ,
DOI : 10.1109/49.29612
Lattice codes can achieve capacity on the AWGN channel, IEEE Transactions on Information Theory, vol.44, issue.1, pp.273-278, 1998. ,
DOI : 10.1109/18.651040
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.96.472
Averaging bounds for lattices and linear codes, IEEE Transactions on Information Theory, vol.43, issue.6, pp.1767-1773, 1997. ,
DOI : 10.1109/18.641543
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.173.6869
Achieving<tex>$ 1over 2log (1+ hboxSNR)$</tex>on the AWGN Channel With Lattice Encoding and Decoding, IEEE Transactions on Information Theory, vol.50, issue.10, pp.2293-2314, 2004. ,
DOI : 10.1109/TIT.2004.834787
Polar lattices: Where Arikan meets Forney, IEEE Int. Symp. Inf. Theory (ISIT), pp.1292-1296, 2013. ,
DOI : 10.1109/isit.2013.6620435
Approaching the ergodic capacity with lattice coding, 2014 IEEE Global Communications Conference, pp.1492-1496, 2014. ,
DOI : 10.1109/GLOCOM.2014.7037019
Achieving the ergodic capacity with lattice codes, 2015 IEEE International Symposium on Information Theory (ISIT), 2015. ,
DOI : 10.1109/ISIT.2015.7282493
Lattice Coding and Decoding Achieve the Optimal Diversity-Multiplexing Tradeoff of MIMO Channels, IEEE Trans. Inform. Theory, vol.50, issue.6, pp.968-985, 2004. ,
Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap, IEEE Transactions on Information Theory, vol.61, issue.1, pp.323-340, 2015. ,
DOI : 10.1109/TIT.2014.2370047
Constructive high-dimensional sphere packings, Duke Mathematical Journal, vol.54, issue.1, pp.147-161, 1987. ,
DOI : 10.1215/S0012-7094-87-05411-1
Diagonal Lattice Space–Time Codes From Number Fields and Asymptotic Bounds, IEEE Transactions on Information Theory, vol.53, issue.11, pp.3921-3926, 2007. ,
DOI : 10.1109/TIT.2007.907473
Constellations matched to the Rayleigh fading channel, IEEE Trans. Inf. Theory, vol.42, issue.1, pp.106-115, 1996. ,
Dense MIMO Matrix Lattices ??? A Meeting Point for Class Field Theory and Invariant Theory, Proc. Applied Algebra, Algebraic Algorithms, and Error Correcting Codes (AAECC-17), 2007. ,
DOI : 10.1007/978-3-540-77224-8_29
Dispersion Analysis of Infinite Constellations in Ergodic Fading Channels, 2013. ,
Polar Codes and Polar Lattices for Independent Fading Channels, IEEE Int. Symp. Inf. Theory (ISIT), 2016. ,
DOI : 10.1109/tcomm.2016.2613109
URL : http://arxiv.org/pdf/1601.04967
Algebraic lattice codes achieve the capacity of the compound block-fading channel, 2016 IEEE International Symposium on Information Theory (ISIT), 2016. ,
DOI : 10.1109/ISIT.2016.7541431
Constructions of uniform distributions in terms of geometry of numbers, Algebra i Analiz, vol.6, issue.3, pp.200-230, 1994. ,
EUCLIDEAN MINIMA AND CENTRAL DIVISION ALGEBRAS, International Journal of Number Theory, vol.28, issue.07, pp.1155-1168, 2000. ,
DOI : 10.1007/BFb0091027
URL : https://hal.archives-ouvertes.fr/hal-00282364
Probability and measure, 1995. ,
Dynamical Systems and Ergodic Theory, 1998. ,
DOI : 10.1017/CBO9781139173049
Space-Time Coding: an Overview, Journal of Communications Software and Systems, vol.2, issue.3, pp.212-227, 2006. ,
DOI : 10.24138/jcomss.v2i3.284
URL : http://doi.org/10.24138/jcomss.v2i3.284
Capacity of a mobile multiple-antenna communication link in Rayleigh flat fading, IEEE Transactions on Information Theory, vol.45, issue.1, 1999. ,
DOI : 10.1109/18.746779
The Distribution of the Determinant of a Complex Wishart Distributed Matrix, The Annals of Mathematical Statistics, vol.34, issue.1, pp.178-180 ,
DOI : 10.1214/aoms/1177704251
Eigenvalues and Condition Numbers of Random Matrices, SIAM Journal on Matrix Analysis and Applications, vol.9, issue.4, 1989. ,
DOI : 10.1137/0609045
URL : http://dspace.mit.edu/bitstream/1721.1/14322/2/21864285-MIT.pdf
Infinite Global Fields and the Generalized Brauer-Siegel Theorem, Moscow Mathematical Journal, vol.2, issue.2, pp.329-402, 2002. ,
URL : https://hal.archives-ouvertes.fr/hal-00104586
Asymptotically Good Towers of Global Fields, Proc. European Congress of Mathematics, pp.207-218, 2001. ,
DOI : 10.1007/978-3-0348-8266-8_16
On class field towers, Izv. Akad. Nauk SSSSR, vol.28, pp.261-272, 1964. ,
DOI : 10.1090/trans2/048/05
Finding maximal orders in semisimple algebras over Q, Computational Complexity, vol.2, issue.3, pp.245-261, 1993. ,
DOI : 10.1007/BF01271370
Good lattice constellations for both Rayleigh fading and Gaussian channels, IEEE Transactions on Information Theory, vol.42, issue.2, 1996. ,
DOI : 10.1109/18.485720
Algebraic lattice constellations: bounds on performance, IEEE Transactions on Information Theory, vol.52, issue.1, pp.319-327, 2006. ,
DOI : 10.1109/TIT.2005.860452
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.301.7094
Fading channels: information-theoretic and communications aspects, IEEE Transactions on Information Theory, vol.44, issue.6, pp.2619-2692, 1998. ,
DOI : 10.1109/18.720551
URL : http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.1.2228&rep=rep1&type=pdf
Inverse Determinant Sums and Connections Between Fading Channel Information Theory and Algebra, IEEE Transactions on Information Theory, vol.59, issue.9, pp.6060-6082, 2013. ,
DOI : 10.1109/TIT.2013.2266396
URL : https://hal.archives-ouvertes.fr/hal-00822339
Modulation schemes designed for the Rayleigh channel, Proc. CISS '92, pp.288-293, 1992. ,
Bounds for discriminants and related estimates for class numbers, regulators and zeros of zeta functions : a survey of recent results, Journal de Th??orie des Nombres de Bordeaux, vol.2, issue.1, pp.119-141, 1990. ,
DOI : 10.5802/jtnb.22
Algebraic methods for channel coding, 2005. ,
Almost universal codes for fading wiretap channels, 2016 IEEE International Symposium on Information Theory (ISIT), 2016. ,
DOI : 10.1109/ISIT.2016.7541866
URL : https://hal.archives-ouvertes.fr/hal-01420943
Universal space~time trellis codes, IEEE Transactions on Information Theory, vol.49, issue.10, pp.2717-2727, 2003. ,
DOI : 10.1109/TIT.2003.817459