Information bounds and flatness factor approximation for fading wiretap MIMO channels

Amaro Barreal Fernandez, Alex Karrila, David A. Karpuk, Camilla Hollanti

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

3 Citations (Scopus)
97 Downloads (Pure)


In this article, the design of secure lattice coset codes for general wireless channels with fading and Gaussian noise is studied. Recalling the eavesdropper's probability and information bounds, a variant of the latter is given from which it is explicitly seen that both quantities are upper bounded by (increasing functions of) the expected flatness factor of the faded lattice related to the eavesdropper. By making use of a recently developed approximation of the theta series of a lattice, it is further shown how the average flatness factor can be approximated numerically. In particular, based on the numerical computations, the average flatness factor not only bounds but also orders correctly the performance of different lattices.

Original languageEnglish
Title of host publication26th International Telecommunication Networks and Applications Conference, ITNAC 2016
Number of pages6
ISBN (Electronic)9781509009190
Publication statusPublished - 14 Mar 2017
MoE publication typeA4 Article in a conference publication
EventInternational Telecommunication Networks and Applications Conference - Dunedin, New Zealand
Duration: 7 Dec 20169 Dec 2016
Conference number: 26


ConferenceInternational Telecommunication Networks and Applications Conference
Abbreviated titleITNAC
CountryNew Zealand

Fingerprint Dive into the research topics of 'Information bounds and flatness factor approximation for fading wiretap MIMO channels'. Together they form a unique fingerprint.

Cite this