Information bounds and flatness factor approximation for fading wiretap MIMO channels

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

Details

Original languageEnglish
Title of host publication26th International Telecommunication Networks and Applications Conference, ITNAC 2016
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

Conference

ConferenceInternational Telecommunication Networks and Applications Conference
Abbreviated titleITNAC
CountryNew Zealand
CityDunedin
Period07/12/201609/12/2016

Researchers

Research units

Abstract

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.

Download statistics

No data available

ID: 12134379