Almost universal codes for MIMO wiretap channels

Laura Luzzi, Roope Vehkalahti, Cong Ling

Research output: Contribution to journalArticleScientificpeer-review

5 Citations (Scopus)


Despite several works on secrecy coding for fading and MIMO wiretap channels from an error probability perspective, the construction of information-theoretically secure codes over such channels remains an open problem. In this paper, we consider a fading wiretap channel model where the transmitter has only partial statistical channel state information. Our channel model includes static channels, i.i.d. block fading channels, and ergodic stationary fading with fast decay of large deviations for the eavesdropper’s channel. We extend the flatness factor criterion from the Gaussian wiretap channel to fading and MIMO wiretap channels, and establish a simple design criterion where the normalized product distance / minimum determinant of the lattice and its dual should be maximized simultaneously. Moreover, we propose concrete lattice codes satisfying this design criterion, which are built from algebraic number fields with constant root discriminant in the single-antenna case, and from division algebras centered at such number fields in the multiple-antenna case. The proposed lattice codes achieve strong secrecy and semantic security for all rates R < Сb – Сe – κ, where Сb and Сe are Bob and Eve’s channel capacities respectively, and κ is an explicit constant gap. Furthermore, these codes are almost universal in the sense that a fixed code is good for secrecy for a wide range of fading models. Finally, we consider a compound wiretap model with a more restricted uncertainty set, and show that rates R < Сb – Сe –κ are achievable, where Сb is a lower bound for Bob’s capacity and Сe is an upper bound for Eve’s capacity for all the channels in the set.

Original languageEnglish
Pages (from-to)7218-7241
Number of pages24
JournalIEEE Transactions on Information Theory
Issue number11
Early online date18 Jul 2018
Publication statusPublished - Nov 2018
MoE publication typeA1 Journal article-refereed


  • algebraic number theory
  • division algebras
  • fading wiretap channel
  • information theoretic security
  • lattice coding
  • MIMO wiretap channel
  • statistical CSIT


Dive into the research topics of 'Almost universal codes for MIMO wiretap channels'. Together they form a unique fingerprint.
  • Coding for Machine-type Communications

    Pääkkönen, J., Deng, J., Tirkkonen, O., Singh, B., Boyd, C., Liao, J., Vehkalahti, R., Shahbaztabar, D. & Pllaha, T.


    Project: Academy of Finland: Other research funding

  • Cloud Security Services - Pilven tietoturvapalvelut

    Tamrakar, S., Paverd, A., Liu, J., Nyman, T., Asokan, N. & Bhattacharya, S.


    Project: Academy of Finland: Other research funding

Cite this